graphalgorithms.H File Reference

#include <relation.H>
#include <graph.H>
#include <random.H>

Include dependency graph for graphalgorithms.H:

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

Go to the source code of this file.

Classes
class	Designar::DefaultDistance< GT >
class	Designar::DistanceCmp< GT, Distance, Cmp >
class	Designar::Kruskal< GT, Distance, Cmp >
class	Designar::ArcHeapCmp< GT, Distance, Cmp >
class	Designar::ArcHeap< GT, Distance, Cmp >
class	Designar::Prim< GT, Distance, Cmp >
class	Designar::Dijkstra< GT, Distance, Cmp, Plus >
class	Designar::DefaultHeuristic< GT, Distance >
class	Designar::Astar< GT, Distance, Heuristic, Cmp, Plus >
class	Designar::BellmanFord< GT, Distance, Cmp, Plus >
class	Designar::KargerMinCut< GT >
class	Designar::OutputGraph< GT, NodeOutput, ArcOutput, GraphOutput >
class	Designar::InputGraph< GT, NodeInput, ArcInput, GraphInput >
class	Designar::DotGraph< GT, NodeAttr, ArcAttr, GraphAttr >

Namespaces
	Designar

Functions
template<class GT , class Op >
void	Designar::depth_first_traverse_prefix_rec (const GT &, Node< GT > *, Op &)
template<class GT , class Op >
void	Designar::depth_first_traverse_prefix (const GT &, Op &op)
template<class GT , class Op >
void	Designar::depth_first_traverse_prefix (const GT &g, Op &&op=Op())
template<class GT , class Op >
void	Designar::depth_first_traverse_sufix_rec (const GT &, Node< GT > *, Op &)
template<class GT , class Op >
void	Designar::depth_first_traverse_sufix (const GT &, Op &op)
template<class GT , class Op >
void	Designar::depth_first_traverse_sufix (const GT &g, Op &&op=Op())
template<class GT , class Op >
void	Designar::depth_first_traverse (const GT &g, Op &op)
template<class GT , class Op >
void	Designar::depth_first_traverse (const GT &g, Op &&op=Op())
template<class GT >
bool	Designar::depth_first_search_path_rec (const GT &, Node< GT > *, Node< GT > *, Path< GT > &)
template<class GT >
Path< GT >	Designar::depth_first_search_path (const GT &, Node< GT > *, Node< GT > *)
template<class GT >
bool	Designar::test_cycle_rec (const GT &, Node< GT > *, bool)
template<class GT >
bool	Designar::has_cycle (const GT &, Node< GT > *)
template<class GT >
bool	Designar::has_cycle (const GT &)
template<class GT >
bool	Designar::is_graph_acyclique (const GT &, Node< GT > *)
template<class GT >
bool	Designar::is_graph_acyclique (const GT &)
template<class GT >
GT	Designar::invert_digraph (const GT &, bool)
template<class GT >
void	Designar::build_subgraph_rec (const GT &, Node< GT > *, const GT &)
template<class GT >
SLList< GT >	Designar::compute_connected_components (const GT &)
template<class GT >
void	Designar::add_nodes_to_component_rec (const GT &, Node< GT > *, SLList< Node< GT > * > &)
template<class GT >
SLList< SLList< Node< GT > * > >	Designar::connected_components_node_list (const GT &)
template<class GT >
void	Designar::compute_cut_nodes_rec (const GT &, Node< GT > *, Arc< GT > &, SLList< Node< GT > * > &, lint_t &)
template<class GT >
SLList< Node< GT > * >	Designar::compute_cut_nodes (const GT &)
template<class GT >
void	Designar::paint_cut_nodes_connected_components_rec (const GT &, Node< GT > *, lint_t)
template<class GT >
void	Designar::paint_from_cut_node (const GT &, Node< GT > *, lint_t &)
template<class GT >
lint_t	Designar::paint_cut_nodes_subgraphs (const GT &, const SLList< Node< GT > * > &)
template<class GT >
void	Designar::build_cut_nodes_subgraph_rec (const GT &, Node< GT > *, const GT &, lint_t)
template<class GT >
SLList< GT >	Designar::build_cut_nodes_subgraphs (const GT &)
template<class GT >
std::tuple< GT, SLList< Arc< GT > * > >	Designar::build_cut_graph (const GT &, const SLList< Node< GT > * > &)
template<class GT >
std::tuple< SLList< GT >, GT, SLList< Arc< GT > * > >	Designar::compute_cut_nodes_connected_components (const GT &, const SLList< Node< GT > * > &)
template<class GT >
void	Designar::Kosaraju_build_subgraph_rec (const GT &, Node< GT > *, const GT &, nat_t)
template<class GT >
SLList< GT >	Designar::Kosaraju_compute_strong_connected_components (const GT &)
template<class GT >
SLList< Node< GT > * >	Designar::df_topological_sort (const GT &)
template<class GT , class Op >
void	Designar::breadth_first_traverse (const GT &, Node< GT > *, Op &)
template<class GT , class Op >
void	Designar::breadth_first_traverse (const GT &g, Node< GT > *p, Op &&op=Op())
template<class GT , class Op >
void	Designar::breadth_first_traverse (const GT &g, Op &op)
template<class GT , class Op >
void	Designar::breadth_first_traverse (const GT &g, Op &&op=Op())
template<class GT >
Path< GT >	Designar::breadth_first_search_path (const GT &g, Node< GT > *, Node< GT > *)
template<class GT >
SLList< Node< GT > * >	Designar::bf_topological_sort (const GT &)
template<class GT >
SLList< SLList< Node< GT > * > >	Designar::topological_ranks (const GT &)
template<class GT >
bool	Designar::is_acyclique (const GT &g, Node< GT > *start)
template<class GT >
bool	Designar::is_acyclique (const GT &g)
template<class GT >
GT	Designar::invert_digraph (const GT &g)
template<class GT >
void	Designar::build_subgraph_rec (const GT &g, Node< GT > *p, GT &t)
template<class GT >
void	Designar::compute_cut_nodes_rec (const GT &g, Node< GT > *p, Arc< GT > *a, SLList< Node< GT > * > &l, lint_t &cdf)
template<class GT >
void	Designar::build_cut_nodes_subgraph_rec (const GT &g, Node< GT > *p, GT &t, lint_t color)
template<class GT >
void	Designar::Kosaraju_build_subgraph_rec (const GT &inv_g, Node< GT > *p, GT &sg, nat_t num)