Struct DirectedGraph

pub struct DirectedGraph<N = String, V = i64>
where
    N: Node,
    V: Weight,
{ /* private fields */ }

Implementations

impl<N, V> DirectedGraph<N, V>

where N: Node, V: Weight,

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

Trait Implementations

impl<N, V> AsMut<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn as_mut(&mut self) -> &mut AdjacencyTable<N, V>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<N, V> AsRef<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn as_ref(&self) -> &AdjacencyTable<N, V>

Converts this type into a shared reference of the (usually inferred) input type.

impl<N, V> Clone for DirectedGraph<N, V>

where N: Node + Clone, V: Weight + Clone,

fn clone(&self) -> DirectedGraph<N, V>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<N, V> Contain<Edge<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn contains(&self, elem: &Edge<N, V>) -> bool

Contain::contains returns true if the given element is in the Contain instance

fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_all returns true if all elements in the given iterator are in the Contain instance

fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_some returns true if any element in the given iterator is in the Contain instance

impl<N, V> Contain<N> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn contains(&self, elem: &N) -> bool

Contain::contains returns true if the given element is in the Contain instance

fn contains_all(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_all returns true if all elements in the given iterator are in the Contain instance

fn contains_some(&self, iter: impl IntoIterator<Item = T>) -> bool

Contain::contains_some returns true if any element in the given iterator is in the Contain instance

impl<N, V> Debug for DirectedGraph<N, V>

where N: Node + Debug, V: Weight + Debug,

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

Formats the value using the given formatter.

impl<N, V> Default for DirectedGraph<N, V>

where N: Node + Default, V: Weight + Default,

fn default() -> DirectedGraph<N, V>

Returns the “default value” for a type.

impl<'de, N, V> Deserialize<'de> for DirectedGraph<N, V>

where N: Node + Deserialize<'de>, V: Weight + Deserialize<'de>,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N, V> From<AdjacencyTable<N, V>> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn from(store: AdjacencyTable<N, V>) -> Self

Converts to this type from the input type.

impl<N, V> Graph<N, V> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn store_mut(&mut self) -> &mut AdjacencyTable<N, V>

Graph::store_mut returns an owned, mutable instance of the AdjacencyTable

fn store(&self) -> &AdjacencyTable<N, V>

Graph::store returns an owned instance of the AdjacencyTable

fn add_edge(&mut self, edge: Edge<N, V>)

Graph::add_edge inserts a new Edge into the graph

fn add_edges(&mut self, iter: impl IntoIterator<Item = Edge<N, V>>)

Graph::add_edges insert several edges into the graph

fn add_node(&mut self, node: N) -> bool

Graph::add_node if the given Node is not already in the Graph, insert the Node and return true; else return false

fn add_nodes(&mut self, iter: impl IntoIterator<Item = N>)

Graph::add_nodes insert several nodes into the graph

fn contains_edge(&self, edge: &Edge<N, V>) -> bool

Graph::contains_edge returns true if the given Edge is in the graph

fn contains_node(&self, node: &N) -> bool

Graph::contains_node returns true if the given Node is in the graph

fn degree(&self, node: &N) -> Result<usize, GraphError>

Graph::degree returns the degree of the given Node

fn edges(&self) -> Vec<Edge<N, V>>

Graph::edges returns all of the edges persisting within the graph

fn edges_from(&self, node: &N) -> Result<Vec<Edge<N, V>>, GraphError>

Graph::edges_from returns all of the edges originating from the given Node

fn edges_to(&self, node: &N) -> Result<Vec<Edge<N, V>>, GraphError>

Graph::edges_to returns all of the edges terminating at the given Node

fn is_connected(&self) -> bool

Graph::is_connected returns true if the graph is connected

fn neighbors(&self, node: N) -> Result<&Vec<(N, V)>, GraphError>

Graph::neighbors attempts to return a Vec that contains all of the connected Node and their values

fn nodes(&self) -> HashSet<N>

Graph::nodes returns a cloned HashSet of the graph’s current Nodes

impl<N, V> Index<N> for DirectedGraph<N, V>

where N: Node, V: Weight,

type Output = Vec<(N, V)>

The returned type after indexing.

fn index(&self, index: N) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<N, V> IndexMut<N> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn index_mut(&mut self, index: N) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl<N, V> PartialEq for DirectedGraph<N, V>

where N: Node + PartialEq, V: Weight + PartialEq,

fn eq(&self, other: &DirectedGraph<N, V>) -> bool

Tests for self and other values to be equal, and is used by ==.

const fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<N, V> Serialize for DirectedGraph<N, V>

where N: Node + Serialize, V: Weight + Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<N, V> Subgraph<N, V> for DirectedGraph<N, V>

where N: Node, V: Weight,

fn is_subgraph(&self, graph: impl Graph<N, V>) -> bool

impl<N, V> Eq for DirectedGraph<N, V>

where N: Node + Eq, V: Weight + Eq,

impl<N, V> GraphExt<N, V> for DirectedGraph<N, V>

where N: Node, V: Weight,

impl<N, V> StructuralPartialEq for DirectedGraph<N, V>

where N: Node, V: Weight,