Struct DirectedGraph 

pub struct DirectedGraph { /* private fields */ }

A directed graph.

Implementations

impl DirectedGraph

pub fn new() -> Self

pub fn with_n_nodes(n: usize) -> Self

pub fn add_node(&mut self, node: usize)

pub fn add_edge(&mut self, from: usize, to: usize)

pub fn node_count(&self) -> usize

pub fn edge_count(&self) -> usize

pub fn out_degree(&self, node: usize) -> usize

pub fn in_degree(&self, node: usize) -> usize

pub fn successors(&self, node: usize) -> Vec<usize>

pub fn predecessors(&self, node: usize) -> Vec<usize>

pub fn nodes(&self) -> Vec<usize>

pub fn has_edge(&self, from: usize, to: usize) -> bool

pub fn out_edges_map(&self) -> &HashMap<usize, HashSet<usize>>

pub fn to_undirected(&self) -> Graph

Convert to undirected Graph.

Trait Implementations

impl Clone for DirectedGraph

fn clone(&self) -> DirectedGraph

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for DirectedGraph

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DirectedGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for DirectedGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.