geometric-traits 0.2.3

Trait-based algebraic and graph algorithms for Rust, supporting no_std environments
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

//! Shared helpers for node classification algorithms.

use alloc::vec::Vec;

use num_traits::AsPrimitive;

use crate::traits::MonoplexMonopartiteGraph;

/// Returns `(has_predecessor, has_successor)` flags for every node id.
pub(super) fn predecessor_successor_flags<G: ?Sized + MonoplexMonopartiteGraph>(
    graph: &G,
) -> (Vec<bool>, Vec<bool>) {
    let number_of_nodes = graph.number_of_nodes().as_();
    let mut has_predecessor = vec![false; number_of_nodes];
    let mut has_successor = vec![false; number_of_nodes];

    for node in graph.node_ids() {
        for successor_node_id in graph.successors(node) {
            has_predecessor[successor_node_id.as_()] = true;
            has_successor[node.as_()] = true;
        }
    }

    (has_predecessor, has_successor)
}