GraphAlgorithmHelpers.h File Reference

#include <CGRA/utility/Functional.h>
#include <set>
#include <map>
#include <iostream>

Go to the source code of this file.

Classes
class	DoNothingGraphVisitor< VertexID >
class	ForwardingVisitor< Visitor >
struct	IgnoreVertexSetVisitor< VertexID, Base, NodeSet >
struct	IgnoreEdgeSetVisitor< VertexID, Base, EdgeSet >
struct	DebugVisitor< VertexID, Base, OStream >
struct	EventRecordingVisitor< VertexID, Base >
struct	EventRecordingVisitor< VertexID, Base >::Event
struct	StringIDGraph
struct	ReversedGraphFromFaninLists< VertexID, Data >

Functions
template<typename VertexID >
auto	findSingleVertex (VertexID v)
template<typename VertexSet , typename VertexID >
auto	findVertexInSet (const VertexSet &v_set, VertexID &vertex_found)
auto	visitAllVertices ()
auto	acceptAllPaths ()
template<typename VertexID , typename Data >
auto	makeReversedGraphFromFaninLists (Data *data)

Function Documentation

acceptAllPaths()

auto acceptAllPaths ( )

inline

Definition at line 39 of file GraphAlgorithmHelpers.h.

findSingleVertex()

template<typename VertexID >

auto findSingleVertex

(

VertexID

v

)

Definition at line 22 of file GraphAlgorithmHelpers.h.

findVertexInSet()

template<typename VertexSet , typename VertexID >

auto findVertexInSet	(	const VertexSet &	v_set,
		VertexID &	vertex_found
	)

Definition at line 27 of file GraphAlgorithmHelpers.h.

makeReversedGraphFromFaninLists()

template<typename VertexID , typename Data >

auto makeReversedGraphFromFaninLists

(

Data *

data

)

Definition at line 346 of file GraphAlgorithmHelpers.h.

visitAllVertices()

auto visitAllVertices ( )

inline

Definition at line 38 of file GraphAlgorithmHelpers.h.