concept Bi_edge_graph : Out_edge_graph, In_edge_graph;
Extends both the Out_edge_graph
and In_edge_graph
concepts to provide bidirectional adjacency information.
Algorithms | ||
---|---|---|
shortest_path<W>(Vert s, Vert t, Map<Edge, W> w) |
Path |
finds the path from s to t with minimum total edge weights w |
parallel_shortest_path<W>(Vert s, Vert t, Map<Edge, W> w) |
Path |
** finds the path from s to t with minimum total edge weights w in parallel |
** Experimental API that is likely to change.