|
Operations on (directed) graphs.
More...
Go to the source code of this file.
Namespaces |
namespace | faudes |
| libFAUDES resides within the 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::ComputeScc (const Generator &rGen, const SccFilter &rFilter, Idx q0, StateSet &rScc) |
| Compute strongly connected component (SCC)
|
bool | faudes::ComputeScc (const Generator &rGen, const SccFilter &rFilter, StateSet &rScc) |
| Compute one strongly connected components (SCC)
|
bool | faudes::HasScc (const Generator &rGen, const SccFilter &rFilter) |
| Test for strongly connected components (SCC)
|
bool | faudes::ComputeNextScc (const Generator &rGen, SccFilter &rFilter, StateSet &rScc) |
| Compute next SCC.
|
Detailed Description
Operations on (directed) graphs.
Definition in file cfl_graphfncts.cpp.
libFAUDES 2.28a
--- 2016.09.13
--- c++ api documentaion by doxygen
|