[−][src]Function rs_graph::shortestpath::dijkstra::start

pub fn start<'a, A, D, W>(
    adj: A, 
    src: A::Node, 
    weights: W
) -> DijkstraDefault<'a, A, D, W> where
    A: Adjacencies<'a>,
    A::Node: Hash,
    D: Copy + PartialOrd + Zero,
    W: Fn(A::Edge) -> D, 

Start and return an Dijkstra-iterator using default data structures.

This is a convenience wrapper around start_with_data using the default data structures returned by default_data.

Parameters

  • adj: adjacency information for the graph
  • src: the source node at which the search should start.
  • weights: the weight function for each edge