Implement common algorithms on graphs. More...
#include <config.h>
#include <graph/vvgraph.h>
#include <set>
#include <util/unorderedset.h>
#include <utility>
Go to the source code of this file.
Namespaces | |
namespace | algorithms |
Namespace containing various useful algorithms. | |
Functions | |
template<typename VertexContent , typename EdgeContent , bool compact, typename Model , typename tag_t > | |
void | algorithms::shortest_paths_Dijkstra (const std::unordered_set< Vertex< VertexContent > > &srcs, const graph::VVGraph< VertexContent, EdgeContent, compact > &m, Model &model, const tag_t &t) |
template<typename VertexContent , typename EdgeContent , bool compact, typename Model > | |
void | algorithms::shortest_paths_Dijkstra (const Vertex< VertexContent > &src, const graph::VVGraph< VertexContent, EdgeContent, compact > &m, const Model &model) |
template<typename VertexContent , typename EdgeContent , bool compact, typename Model , typename tag_t > | |
void | algorithms::shortest_paths_Dijkstra (const Vertex< VertexContent > &src, const graph::VVGraph< VertexContent, EdgeContent, compact > &m, Model &model, const tag_t &t) |
template<typename VVGraph , typename Model > | |
void | algorithms::shortest_paths_FloydWarshall (const VVGraph &m, const Model &model) |
Compute the shortest path for all pair of vertices in the graph. | |
template<typename VertexContent , typename EdgeContent , bool compact, typename Model , typename tag_t > | |
void | algorithms::shortest_paths_FloydWarshall (const graph::VVGraph< VertexContent, EdgeContent, compact > &m, Model &model, const tag_t &t) |
Implement common algorithms on graphs.
Definition in file graph.h.