libFAUDES

Sections

Index

graphfncts.cpp File Reference


Detailed Description

Operations on (directed) graphs.

Definition in file graphfncts.cpp.

#include "graphfncts.h"

Go to the source code of this file.

Namespaces

namespace  faudes

Functions

void faudes::SearchScc (const Idx vState, int &vRcount, const Generator &rGen, const SccFilter &rFilter, StateSet &rTodo, std::stack< Idx > &rStack, StateSet &rStackStates, std::map< const Idx, int > &rDfn, std::map< const Idx, int > &rLowLnk, std::list< StateSet > &rSccList, StateSet &rRoots)
 Search for strongly connected components (SCC).
bool faudes::ComputeScc (const Generator &rGen, const SccFilter &rFilter, std::list< StateSet > &rSccList, StateSet &rRoots)
 Compute strongly connected components (SCC).
bool faudes::ComputeScc (const Generator &rGen, std::list< StateSet > &rSccList, StateSet &rRoots)
 Compute strongly connected components (SCC).
bool faudes::HasScc (const Generator &rGen, const SccFilter &rFilter, StateSet &rScc)
 Test for strongly connected components (SCC).
bool faudes::HasScc (const Generator &rGen, const SccFilter &rFilter)
 Test for strongly connected components (SCC).

libFAUDES 2.14g --- 2009-12-3 --- c++ source docu by doxygen 1.5.6