paths.hpp File Reference

#include "../../utils/fwd_declares.hpp"
#include <map>
#include <vector>

Include dependency graph for paths.hpp:

Go to the source code of this file.

Classes
struct	TraversalResults< V >

Namespaces
	indigox
	Namespace for all graph related functionality.
	indigox::algorithm

Functions
template<class V , class E , class S , class D , class VP , class EP >
void	AllSimplePaths (graph::BaseGraph< V, E, S, D, VP, EP > &G, V source, V target, std::vector< std::vector< E >> &paths, int64_t limit=-1)
	Find all the simple paths between two vertices. More...
template<class V , class E , class S , class D , class VP , class EP >
TraversalResults< V >	BreadthFirstSearch (graph::BaseGraph< V, E, S, D, VP, EP > &G, V source=V(), int64_t limit=-1)
template<class V , class E , class S , class D , class VP , class EP >
TraversalResults< V >	DepthFirstSearch (graph::BaseGraph< V, E, S, D, VP, EP > &G, V source=V(), int64_t limit=-1)
	Perform a breadth first search of G. More...
template<class V , class E , class S , class D , class VP , class EP >
std::vector< E >	ShortestPath (graph::BaseGraph< V, E, S, D, VP, EP > &G, V source, V target)
	Find the shortest path between two vertices. More...