Loading...
Searching...
No Matches
GraphAlgorithms.hh File Reference
#include <functional>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <utility>
#include <vector>
#include <ignition/math/config.hh>
#include "ignition/math/graph/Graph.hh"
#include "ignition/math/Helpers.hh"
Include dependency graph for GraphAlgorithms.hh:

Go to the source code of this file.

Namespaces

namespace  ignition
 
namespace  ignition::math
 Math classes and function useful in robot applications.
 
namespace  ignition::math::IGNITION_MATH_VERSION_NAMESPACE
 
namespace  ignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph
 

Typedefs

using ignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph::CostInfo = std::pair<double, VertexId>
 

Functions

template<typename V , typename E , typename EdgeType >
std::vector< VertexIdignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph::BreadthFirstSort (const Graph< V, E, EdgeType > &_graph, const VertexId &_from)
 Breadth first sort (BFS).
 
template<typename V , typename E >
std::vector< UndirectedGraph< V, E > > ignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph::ConnectedComponents (const UndirectedGraph< V, E > &_graph)
 Calculate the connected components of an undirected graph.
 
template<typename V , typename E , typename EdgeType >
std::vector< VertexIdignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph::DepthFirstSort (const Graph< V, E, EdgeType > &_graph, const VertexId &_from)
 Depth first sort (DFS).
 
template<typename V , typename E , typename EdgeType >
std::map< VertexId, CostInfoignition::math::IGNITION_MATH_VERSION_NAMESPACE::graph::Dijkstra (const Graph< V, E, EdgeType > &_graph, const VertexId &_from, const VertexId &_to=kNullId)
 Dijkstra algorithm.