pub trait NamedGraph<'i> {
type NameRef;
type NameMut;
// Required methods
fn get_node_name(&'i self, node: NodeID) -> Option<Self::NameRef>;
fn mut_node_name(&'i mut self, node: NodeID) -> Option<Self::NameMut>;
fn set_node_name(&'i mut self, node: NodeID, name: &str);
fn get_edge_name<Q: Into<EdgeQuery>>(
&'i self,
edge: Q
) -> Option<Self::NameRef>;
fn mut_edge_name<Q: Into<EdgeQuery>>(
&'i mut self,
edge: Q
) -> Option<Self::NameMut>;
fn set_edge_name<Q: Into<EdgeQuery>>(&'i mut self, edge: Q, name: &str);
}
Expand description
Labeling a graph can provide Weight information
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;
Remove edge by given edge-id or start and end node-id.
Not all graph engine supports insert edge.
use graph_theory::GraphEngine;