|
|
Operations on (directed) graphs.
More...
#include "cfl_definitions.h"
#include "cfl_generator.h"
#include <stack>
Go to the source code of this file.
|
| | faudes |
| | libFAUDES resides within the namespace faudes.
|
| |
|
| 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). More...
|
| |
| bool | faudes::ComputeScc (const Generator &rGen, const SccFilter &rFilter, std::list< StateSet > &rSccList, StateSet &rRoots) |
| | Compute strongly connected components (SCC) More...
|
| |
| bool | faudes::ComputeScc (const Generator &rGen, std::list< StateSet > &rSccList, StateSet &rRoots) |
| | Compute strongly connected components (SCC) More...
|
| |
| bool | faudes::ComputeScc (const Generator &rGen, const SccFilter &rFilter, Idx q0, StateSet &rScc) |
| | Compute strongly connected component (SCC) More...
|
| |
| bool | faudes::ComputeScc (const Generator &rGen, const SccFilter &rFilter, StateSet &rScc) |
| | Compute one strongly connected component (SCC) More...
|
| |
| bool | faudes::HasScc (const Generator &rGen, const SccFilter &rFilter) |
| | Test for strongly connected components (SCC) More...
|
| |
| bool | faudes::ComputeNextScc (const Generator &rGen, SccFilter &rFilter, StateSet &rScc) |
| | Compute next SCC. More...
|
| |
Operations on (directed) graphs.
Definition in file cfl_graphfncts.h.
libFAUDES 2.32f
--- 2024.12.22
--- c++ api documentaion by doxygen
|