tuxmain/HexoDSP
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

comment Kahns algorithm

Browse source
This commit is contained in:
Weird Constructor 2022-08-18 20:02:39 +02:00
parent 1a1512a032
commit bcc3f76113
1 changed files with 8 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
src/nodes/node_graph_ordering.rs
View file

@ -139,18 +139,22 @@ impl NodeGraphOrdering {
*indeg = 0; *indeg = 0;
} }
// Calculate the number of inputs for each node:
for node in self.nodes.iter().take(self.node_count) { for node in self.nodes.iter().take(self.node_count) {
for out_node_idx in node.edges.iter().take(node.unused_idx) { for out_node_idx in node.edges.iter().take(node.unused_idx) {
self.in_degree[*out_node_idx] += 1; self.in_degree[*out_node_idx] += 1;
} }
} }
// Find the "input" nodes by looking at the nodes without any input. These
// are the first that must be executed!
for idx in 0..self.node_count { for idx in 0..self.node_count {
if self.in_degree[idx] == 0 { if self.in_degree[idx] == 0 {
deq.push_back(idx); deq.push_back(idx);
} }
} }
// Track visit count for cycle detection:
let mut visited_count = 0; let mut visited_count = 0;
while let Some(node_idx) = deq.pop_front() { while let Some(node_idx) = deq.pop_front() {
@ -160,9 +164,13 @@ impl NodeGraphOrdering {
out.push(node.node_id); out.push(node.node_id);
// Push the nodes we output to, to the end of the dequeue:
for neigh_node_idx in node.edges.iter().take(node.unused_idx) { for neigh_node_idx in node.edges.iter().take(node.unused_idx) {
// by reducing the input count of the to be visited node:
self.in_degree[*neigh_node_idx] -= 1; self.in_degree[*neigh_node_idx] -= 1;
// we know when that node has been fully supplied with all it's inputs,
// so we push it to the end of the dequeue to be executed then:
if self.in_degree[*neigh_node_idx] == 0 { if self.in_degree[*neigh_node_idx] == 0 {
deq.push_back(*neigh_node_idx); deq.push_back(*neigh_node_idx);
} }