tpl_find_path.H File Reference

Path finding algorithms in graphs. More...

#include <tpl_dynListStack.H>
#include <tpl_dynListQueue.H>
#include <tpl_graph_utils.H>
#include <ah-errors.H>

Include dependency graph for tpl_find_path.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	Aleph::Dft_Goal_Node< GT >
class	Aleph::Find_Path_Depth_First< GT, Itor, SA >
	Busca en profundidad un camino entre un par de nodos. More...
class	Aleph::Find_Path_Breadth_First< GT, Itor, SA >
	Busca en amplitud un camino entre un par de nodos. More...
class	Aleph::Directed_Find_Path< GT, Itor, SA >
	Búsqueda de caminos sobre grafos dirigidos definidos mediante una clase grafo (no digrafo). More...

Namespaces
namespace	Aleph
	Main namespace for Aleph-w library functions.

Detailed Description

Path finding algorithms in graphs.

Finds paths between nodes using DFS, BFS, or specialized algorithms. For weighted shortest paths, see Dijkstra.H.

Features

• DFS path finding
• BFS path finding (shortest in unweighted)
• All paths enumeration

Complexity: O(V + E)

See also

Dijkstra.H Weighted shortest paths

Bellman_Ford.H Handles negative weights

Author

Leandro Rabindranath León

Definition in file tpl_find_path.H.