tpl_sgraph.H File Reference

Simple graph implementation with adjacency lists. More...

#include <memory>
#include <htlist.H>
#include <tpl_graph.H>
#include <tpl_dynSetTree.H>
#include <ah-errors.H>

Include dependency graph for tpl_sgraph.H:

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

Go to the source code of this file.

Classes
struct	Aleph::Graph_Snode< Node_Info >
	Node for graphs implemented with simple adjacency lists. More...
class	Aleph::Graph_Sarc< Arc_Info >
	Arc for graphs implemented with simple adjacency lists. More...
class	Aleph::List_SGraph< __Graph_Node, __Graph_Arc >
	Graph class implemented with singly-linked adjacency lists. More...
class	Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Iterator
	Node iterator for a graph. More...
class	Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Node_Arc_Iterator
	Arc iterator for a graph node. More...
class	Aleph::List_SGraph< __Graph_Node, __Graph_Arc >::Arc_Iterator
	Iterator over arcs of a graph. More...

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

Typedefs
template<typename __Graph_Node = Graph_Snode<int>, typename __Graph_Arc = Graph_Sarc<int>>
using	Aleph::List_SDigraph = Digraph< List_SGraph< __Graph_Node, __Graph_Arc > >
	Directed graph (digraph) implemented with simple adjacency lists.

Detailed Description

Simple graph implementation with adjacency lists.

This file provides List_SGraph and List_SDigraph, simplified graph implementations using singly linked adjacency lists. These are memory- efficient alternatives to the standard graph classes.

Author

Leandro Rabindranath León

Definition in file tpl_sgraph.H.