32 #ifndef _OMS_DIRECTED_GRAPH_H_ 33 #define _OMS_DIRECTED_GRAPH_H_ 76 void dotExport(
const std::string& filename);
80 const std::vector< scc_t >& getSortedConnections();
82 const std::vector<Connector>&
getNodes()
const {
return nodes;}
86 void dumpNodes()
const;
89 std::deque< std::vector<int> > getSCCs();
90 void calculateSortedConnections();
91 void strongconnect(
int v, std::vector< std::vector<int> > G,
int& index,
int *d,
int *low, std::stack<int>& S,
bool *stacked, std::deque< std::vector<int> >& components);
93 static int getEdgeIndex(
const scc_t& edges,
int from,
int to);
99 std::vector< std::vector<int> >
G;
103 struct suppressUnitConversion
std::set< oms::ComRef > component_names
Definition: DirectedGraph.h:60
oms::ComRef conA
Definition: DirectedGraph.h:105
std::vector< scc_t > sortedConnections
Definition: DirectedGraph.h:100
Strong connected components data type.
Definition: DirectedGraph.h:54
unsigned int size_including_internal
Definition: DirectedGraph.h:59
bool sortedConnectionsAreValid
Definition: DirectedGraph.h:101
Definition: DirectedGraph.h:103
std::vector< std::vector< int > > G
Definition: DirectedGraph.h:99
bool suppressUnitConversion
Definition: DirectedGraph.h:62
bool unitConversion
Definition: DirectedGraph.h:107
ComRef - component reference.
Definition: ComRef.h:46
Connector.
Definition: Connector.h:49
std::vector< std::pair< int, int > > connections
Definition: DirectedGraph.h:56
oms::ComRef conB
Definition: DirectedGraph.h:106
double factor
Definition: DirectedGraph.h:61
bool thisIsALoop
Definition: DirectedGraph.h:57
std::vector< Connector > nodes
Definition: DirectedGraph.h:96
scc_t edges
Definition: DirectedGraph.h:97
const std::vector< Connector > & getNodes() const
Definition: DirectedGraph.h:82
std::vector< suppressUnitConversion > unitConversion
Definition: DirectedGraph.h:110
Definition: DirectedGraph.h:65
unsigned int size
Definition: DirectedGraph.h:58
const scc_t & getEdges() const
Definition: DirectedGraph.h:83