Function dijkstra_paths_with_mode 

pub fn dijkstra_paths_with_mode(
    graph: &Graph,
    source: VertexId,
    weights: &[f64],
    mode: DijkstraMode,
) -> IgraphResult<DijkstraPaths>

Mode-aware dijkstra_paths. Counterpart of igraph_get_shortest_paths_dijkstra(_, _, _, source, vss_all(), weights, mode, parents, inbound_edges).

Examples

use rust_igraph::{Graph, dijkstra_paths_with_mode, DijkstraMode};

let mut g = Graph::with_vertices(3);
g.add_edge(0, 1).unwrap();
g.add_edge(1, 2).unwrap();
let p = dijkstra_paths_with_mode(&g, 0, &[1.0, 1.0], DijkstraMode::All).unwrap();
assert!(p.distances[2].is_some());