graph::shortest_path::FloydWarshall Class Reference

#include <FloydWarshall.hpp>

Static Public Member Functions
template<typename TGraph >
static ext::map< typename TGraph::node_type, ext::map< typename TGraph::node_type, typename TGraph::edge_type::weight_type > >	run (const TGraph &graph)

Member Function Documentation

run()

template<typename TGraph >

ext::map< typename TGraph::node_type, ext::map< typename TGraph::node_type, typename TGraph::edge_type::weight_type > > graph::shortest_path::FloydWarshall::run ( const TGraph &  graph )

static

Find the shortest paths using FloydWarshall algorithm in the graph.

Parameters

graph

to explore.

Returns

distances matrix implemented with two ext::map.

Note

TEdge of graph must follow graph::edge::WeightedEdge interface.

See also

graph::edge_type::WeightedEdge.

Exceptions

std::out_of_range

if graph contains negative cycle.

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• alib2graph_algo/src/shortest_path/FloydWarshall.hpp