graph-traverse.H File Reference

Graph traversal algorithms (DFS, BFS). More...

#include <tuple>
#include <cassert>
#include <tpl_agraph.H>
#include <tpl_dynListStack.H>
#include <tpl_dynListQueue.H>

Include dependency graph for graph-traverse.H:

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

Go to the source code of this file.

Classes
class	Graph_Traverse< GT, Itor, Q, Show_Arc >
	Traverse a graph depth-first or breadth-first and execute a visit function. More...

Typedefs
template<class GT , class Itor , class Show_Arc = Dft_Show_Arc<GT>>
using	Graph_Traverse_DFS = Graph_Traverse< GT, Itor, DynListStack, Show_Arc >
template<class GT , class Itor , class Show_Arc = Dft_Show_Arc<GT>>
using	Graph_Traverse_BFS = Graph_Traverse< GT, Itor, DynListQueue, Show_Arc >

Detailed Description

Graph traversal algorithms (DFS, BFS).

Provides depth-first search (DFS) and breadth-first search (BFS) traversal algorithms with customizable visitor callbacks.

Author

Leandro Rabindranath León

Definition in file graph-traverse.H.

Typedef Documentation

Graph_Traverse_BFS

template<class GT , class Itor , class Show_Arc = Dft_Show_Arc<GT>>

using Graph_Traverse_BFS = Graph_Traverse<GT, Itor, DynListQueue, Show_Arc>

Definition at line 328 of file graph-traverse.H.

Graph_Traverse_DFS

template<class GT , class Itor , class Show_Arc = Dft_Show_Arc<GT>>

using Graph_Traverse_DFS = Graph_Traverse<GT, Itor, DynListStack, Show_Arc>

Definition at line 324 of file graph-traverse.H.