1 #include "cyclegraph.h"
4 CycleGraph::CycleGraph() {
8 CycleNode * CycleGraph::getNode(ModelAction * action) {
9 CycleNode *node=actionToNode.get(action);
11 node=new CycleNode(action);
12 actionToNode.put(action, node);
17 void CycleGraph::addEdge(ModelAction *from, ModelAction *to) {
18 CycleNode *fromnode=getNode(from);
19 CycleNode *tonode=getNode(to);
22 hasCycles=checkReachable(fromnode, tonode);
24 fromnode->addEdge(tonode);
27 bool CycleGraph::checkReachable(CycleNode *from, CycleNode *to) {
28 std::vector<CycleNode *> queue;
29 HashTable<CycleNode *, CycleNode *, uintptr_t, 4> discovered;
31 queue.push_back(from);
32 discovered.put(from, from);
33 while(!queue.empty()) {
34 CycleNode * node=queue.back();
39 for(unsigned int i=0;i<node->getEdges()->size();i++) {
40 CycleNode *next=(*node->getEdges())[i];
41 if (!discovered.contains(next)) {
42 discovered.put(next,next);
43 queue.push_back(next);
50 CycleNode::CycleNode(ModelAction *modelaction) {
54 std::vector<CycleNode *> * CycleNode::getEdges() {
58 void CycleNode::addEdge(CycleNode * node) {
59 edges.push_back(node);