55template<
class GraphType>
147 while(!topoOrder.empty())
149 NodeID nodeID = topoOrder.top();
151 revTopoOrder.
push(nodeID);
167 return rep!= UINT_MAX ?
rep :
n ;
185 for (; EI != EE; ++EI)
200 return it->second.subNodes();
264 return GTraits::getNode(
_graph,
id);
269 return GTraits::getNodeID(node);
283 for (; EI != EE; ++EI)
293 this->
rep(v) : this->
rep(w);
297 if (this->
rep(v) == v)
349 if (this->
rep(node) == UINT_MAX || this->
rep(node) == node)
361 for (
NodeID node : candidates)
365 if (this->
rep(node) == UINT_MAX || this->
rep(node) == node)
bool push(const Data &data)
const NodeBS & subNodes() const
void addSubNodes(NodeID n)
void rep(NodeID n, NodeID r)
SCCDetection(const GraphType >)
const GNodeStack & topoNodeStack() const
void find(NodeSet &candidates)
const CallGraph *& _graph
NodeID repNode(NodeID n) const
get the rep node if not found return itself
GNODESCCInfoMap _NodeSCCAuxInfo
Map< NodeID, GNodeSCCInfo > GNODESCCInfoMap
bool isInCycle(NodeID n) const
whether the node is in a cycle
NodeID Node_Index(GNODE node) const
GNODE Node(NodeID id) const
Map< NodeID, NodeID > NodeToNodeMap
GNodeStack & topoNodeStack()
std::stack< NodeID > GNodeStack
SVF::GenericGraphTraits< CallGraph * > GTraits
FIFOWorkList< NodeID > revTopoNodeStack() const
const NodeBS & getRepNodes() const
get all repNodeID
const NodeBS & subNodes(NodeID n) const
get all subnodes in one scc, if size is empty insert itself into the set
void setInSCC(NodeID n, bool v)
const GNODESCCInfoMap & GNodeSCCInfo() const
GTraits::nodes_iterator node_iterator
GTraits::ChildIteratorType child_iterator
void setVisited(NodeID n, bool v)
const GraphType & graph()
std::unordered_map< Key, Value, Hash, KeyEqual, Allocator > Map
typename GraphType::UnknownGraphTypeError NodeRef