Struct directed_graph::DirectedGraph

pub struct DirectedGraph<T: PartialEq + Hash + Copy + Ord + Debug + Display>(/* private fields */);

A directed graph, whose nodes contain an identifier of type T.

Implementations

impl<T: PartialEq + Hash + Copy + Ord + Debug + Display> DirectedGraph<T>

pub fn new() -> Self

Created a new empty DirectedGraph.

pub fn add_edge(&mut self, source: T, target: T)

Add an edge to the graph, adding nodes if necessary.

pub fn get_targets(&self, id: T) -> Option<&HashSet<T>>

Get targets of all edges from this node.

pub fn topological_sort(&self) -> Result<Vec<T>, Error<T>>

Returns the nodes of the graph in reverse topological order, or an error if the graph contains a cycle.

TODO: //src/devices/tools/banjo/srt/ast.rs can be migrated to use this feature.

pub fn find_shortest_path(&self, from: T, to: T) -> Option<Vec<T>>

Finds the shortest path between the from and to nodes in this graph, if such a path exists. Both from and to are included in the returned path.

Trait Implementations

impl<T: PartialEq + Hash + Copy + Ord + Debug + Display> Default for DirectedGraph<T>

fn default() -> Self

Returns the “default value” for a type.