Algorithms Library Toolkit: graph::common::ReconstructPath Class Reference

Algorithms Library Toolkit

A toolkit for algorithms, especially for algorithms on formal languages

#include <ReconstructPath.hpp>

Static Public Member Functions
template<typename TNode >
static ext::vector< TNode >	reconstructPath (const ext::map< TNode, TNode > &p, const TNode &start, const TNode &goal)

template<typename TNode >
static ext::vector< TNode >	reconstructPath (const ext::map< TNode, TNode > &p_forward, const ext::map< TNode, TNode > &p_backward, const TNode &start, const TNode &goal, const TNode &intersection_node)

template<typename TNode , typename TWeight >
static ext::pair< ext::vector< TNode >, TWeight >	reconstructWeightedPath (const ext::map< TNode, TNode > &p, const ext::map< TNode, TWeight > &g, const TNode &start, const TNode &goal)

template<typename TNode , typename TWeight >
static ext::pair< ext::vector< TNode >, TWeight >	reconstructWeightedPath (const ext::map< TNode, TNode > &p_forward, const ext::map< TNode, TNode > &p_backward, const ext::map< TNode, TWeight > &g_forward, const ext::map< TNode, TWeight > &g_backward, const TNode &start, const TNode &goal, const TNode &intersection_node)

template<typename TNode >
static ext::vector< TNode >	joinPath (ext::vector< TNode > &forward_path, const ext::vector< TNode > &backward_path)

Member Function Documentation

◆ joinPath()

template<typename TNode >

ext::vector< TNode > graph::common::ReconstructPath::joinPath	(	ext::vector< TNode > &	forward_path,
		const ext::vector< TNode > &	backward_path
	)

static

Here is the call graph for this function:

◆ reconstructPath() [1/2]

template<typename TNode >

ext::vector< TNode > graph::common::ReconstructPath::reconstructPath	(	const ext::map< TNode, TNode > &	p,
		const TNode &	start,
		const TNode &	goal
	)

static

Here is the call graph for this function:

Here is the caller graph for this function:

◆ reconstructPath() [2/2]

template<typename TNode >

ext::vector< TNode > graph::common::ReconstructPath::reconstructPath	(	const ext::map< TNode, TNode > &	p_forward,
		const ext::map< TNode, TNode > &	p_backward,
		const TNode &	start,
		const TNode &	goal,
		const TNode &	intersection_node
	)

static

Here is the call graph for this function:

◆ reconstructWeightedPath() [1/2]

template<typename TNode , typename TWeight >

ext::pair< ext::vector< TNode >, TWeight > graph::common::ReconstructPath::reconstructWeightedPath	(	const ext::map< TNode, TNode > &	p,
		const ext::map< TNode, TWeight > &	g,
		const TNode &	start,
		const TNode &	goal
	)

static

Here is the call graph for this function:

Here is the caller graph for this function:

◆ reconstructWeightedPath() [2/2]

template<typename TNode , typename TWeight >

ext::pair< ext::vector< TNode >, TWeight > graph::common::ReconstructPath::reconstructWeightedPath	(	const ext::map< TNode, TNode > &	p_forward,
		const ext::map< TNode, TNode > &	p_backward,
		const ext::map< TNode, TWeight > &	g_forward,
		const ext::map< TNode, TWeight > &	g_backward,
		const TNode &	start,
		const TNode &	goal,
		const TNode &	intersection_node
	)

static

Here is the call graph for this function:

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

alib2graph_algo/src/common/ReconstructPath.hpp