tpl_agraph.H File Reference

Array-based graph implementation. More...

#include <tpl_dynSetTree.H>
#include <array_it.H>
#include <tpl_sgraph.H>
#include <ah-errors.H>

Include dependency graph for tpl_agraph.H:

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

Go to the source code of this file.

Classes
class	Aleph::Graph_Anode< Node_Info >
	Node of Array_Graph More...
class	Aleph::Graph_Aarc< Arc_Info >
class	Aleph::Array_Graph< __Graph_Node, __Graph_Arc >
struct	Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Node_Iterator
struct	Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Arc_Iterator
	Iterator over arcs of a graph. More...
class	Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Node_Arc_Iterator
struct	Aleph::Array_Graph< __Graph_Node, __Graph_Arc >::Cmp_Arc< Cmp >

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

Typedefs
template<typename __Graph_Node = Graph_Anode<int>, typename __Graph_Arc = Graph_Aarc<int>>
using	Aleph::Array_Digraph = Digraph< Array_Graph< __Graph_Node, __Graph_Arc > >
	Directed graph (digraph) implemented with array-based adjacency lists.

Detailed Description

Array-based graph implementation.

This file provides Array_Graph and Array_Digraph, graph implementations that use arrays for node storage. These offer better cache locality for dense graphs and efficient indexed access to nodes.

Author

Leandro Rabindranath León

Definition in file tpl_agraph.H.