graph.h File Reference

A Template Class for Graphs. More...

#include <list>
#include <stack>
#include <map>
#include <vector>
#include <ostream>
#include <cassert>
#include <algorithm>
#include <queue>
#include "invariant.h"

Include dependency graph for graph.h:

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

Go to the source code of this file.

Classes
class	empty_edget
class	graph_nodet< E >
	This class represents a node in a directed graph. More...
class	visited_nodet< E >
	A node type with an extra bit. More...
class	grapht< N >
	A generic directed graph with a parametric node type. More...
class	grapht< N >::tarjant

Functions
template<class E >
void	intersection (const typename graph_nodet< E >::edgest &a, const typename graph_nodet< E >::edgest &b, typename graph_nodet< E >::edgest &dest)
	Compute intersection of two edge sets, in linear time. More...

Detailed Description

A Template Class for Graphs.

Definition in file graph.h.

Function Documentation

intersection()

template<class E >

void intersection	(	const typename graph_nodet< E >::edgest &	a,
		const typename graph_nodet< E >::edgest &	b,
		typename graph_nodet< E >::edgest &	dest
	)

Compute intersection of two edge sets, in linear time.

Definition at line 81 of file graph.h.