HLIBpro
2.2
|
Uses a heuristic algorithm to compute feedback vertex set of a directed graph represented by a sparse matrix.
#include <TFVS.hh>
Public Member Functions | |
void | build_fvs (const TSparseMatrix *S, std::list< node_t > &fvs) const |
build FVS for S | |
void | build_fvs (const TSparseMatrix *S, const std::list< node_t > &del_nodes, std::list< node_t > &fvs) const |
build FVS for S with nodes in del_nodes already deleted | |