Trait traitgraph::walks::NodeWalk

pub trait NodeWalk<'a, Graph: GraphBase, NodeSubwalk: NodeWalk<'a, Graph, NodeSubwalk> + ?Sized>: Sequence<'a, Graph::NodeIndex, NodeSubwalk> where
    Graph::NodeIndex: 'a, {
    fn clone_as_edge_walk<ResultWalk: From<Vec<Graph::EdgeIndex>>>(
        &'a self, 
        graph: &Graph
    ) -> Option<ResultWalk>
    where
        Graph: StaticGraph,
    { ... }
    fn is_proper_subwalk_of(&'a self, other: &Self) -> bool
    where
        Graph::NodeIndex: Eq,
    { ... }
}

A sequence of nodes in a graph, where each consecutive pair of nodes is connected by an edge.

Provided methods

fn clone_as_edge_walk<ResultWalk: From<Vec<Graph::EdgeIndex>>>(
    &'a self,
    graph: &Graph
) -> Option<ResultWalk> where
    Graph: StaticGraph, 

Returns the edge walk represented by this node walk. If there is a consecutive pair of nodes with a multiedge, then None is returned. If this walk contains less than two nodes, then None is returned. If there is a consecutive pair of node not connected by an edge, then this method panics.

fn is_proper_subwalk_of(&'a self, other: &Self) -> bool where
    Graph::NodeIndex: Eq, 

Returns true if this is a proper subwalk of the given walk. Proper means that the walks are not equal.

Implementations on Foreign Types

impl<'a, Graph: GraphBase> NodeWalk<'a, Graph, [<Graph as GraphBase>::NodeIndex]> for [Graph::NodeIndex] where
    Graph::NodeIndex: 'a, 

Implementors

impl<'a, Graph: GraphBase> NodeWalk<'a, Graph, [<Graph as GraphBase>::NodeIndex]> for VecNodeWalk<Graph> where
    Graph::NodeIndex: 'a,