Function widest_path_with_mode 

pub fn widest_path_with_mode(
    graph: &Graph,
    from: VertexId,
    to: VertexId,
    weights: &[f64],
    mode: DijkstraMode,
) -> IgraphResult<Option<(Vec<VertexId>, Vec<u32>)>>

Widest path with mode selection. Mirrors widest_path but lets you pick OUT/IN/ALL traversal on directed graphs.

Counterpart of igraph_get_widest_path(_, _, _, from, to, weights, mode).

Examples

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

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