OMSimulatorLib
The OMSimulator project is a FMI-based co-simulation environment that supports ordinary (i.e., non-delayed) and TLM connections.
|
Go to the documentation of this file.
32 #ifndef _OMS_DIRECTED_GRAPH_H_
33 #define _OMS_DIRECTED_GRAPH_H_
75 void dotExport(
const std::string& filename);
88 std::deque< std::vector<int> >
getSCCs();
90 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);
98 std::vector< std::vector<int> >
G;
int addNode(const Connector &var)
Definition: DirectedGraph.cpp:66
Strong connected components data type.
Definition: DirectedGraph.h:53
ComRef - component reference.
Definition: ComRef.h:46
oms::ComRef conA
Definition: DirectedGraph.h:104
void includeGraph(const DirectedGraph &graph, const ComRef &prefix)
Definition: DirectedGraph.cpp:140
std::vector< Connector > nodes
Definition: DirectedGraph.h:95
std::vector< suppressUnitConversion > unitConversion
Definition: DirectedGraph.h:109
#define logInfo(msg)
Definition: Logging.h:100
Definition: DirectedGraph.h:64
bool unitConversion
Definition: DirectedGraph.h:106
static int getEdgeIndex(const scc_t &edges, int from, int to)
Definition: DirectedGraph.cpp:149
const std::vector< scc_t > & getSortedConnections()
Definition: DirectedGraph.cpp:247
std::map< std::string, std::map< std::string, std::string > > connectorUnits
single entry map which contains unit as key and BaseUnits as value for a connector
Definition: Connector.h:74
void addEdge(const Connector &var1, const Connector &var2)
Definition: DirectedGraph.cpp:74
std::vector< std::vector< int > > G
Definition: DirectedGraph.h:98
bool suppressUnitConversion
Definition: DirectedGraph.h:61
unsigned int size
Definition: DirectedGraph.h:57
void calculateSortedConnections()
Definition: DirectedGraph.cpp:254
std::vector< scc_t > sortedConnections
Definition: DirectedGraph.h:99
~DirectedGraph()
Definition: DirectedGraph.cpp:53
bool thisIsALoop
Definition: DirectedGraph.h:56
void setUnits(Connector *conA, Connector *conB, bool suppressUnitConversion)
Definition: DirectedGraph.cpp:338
std::deque< std::vector< int > > getSCCs()
Definition: DirectedGraph.cpp:207
oms::ComRef conB
Definition: DirectedGraph.h:105
unsigned int size_including_internal
Definition: DirectedGraph.h:58
const oms::ComRef getName() const
Definition: Connector.h:80
#define logError(msg)
Definition: Logging.h:102
const scc_t & getEdges() const
Definition: DirectedGraph.h:82
std::set< oms::ComRef > component_names
Definition: DirectedGraph.h:59
DirectedGraph()
Definition: DirectedGraph.cpp:48
scc_t edges
Definition: DirectedGraph.h:96
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)
Definition: DirectedGraph.cpp:159
ComRef pop_front()
returns the first part of the ComRef and removed it from the current object
Definition: ComRef.cpp:184
std::vector< std::pair< int, int > > connections
Definition: DirectedGraph.h:55
void dumpNodes() const
Definition: DirectedGraph.cpp:369
const std::vector< Connector > & getNodes() const
Definition: DirectedGraph.h:81
Definition: DirectedGraph.h:102
Connector.
Definition: Connector.h:49
double factor
Definition: DirectedGraph.h:60
void clear()
Definition: DirectedGraph.cpp:57
const oms::ComRef getOwner() const
Definition: Connector.h:79
static bool isValid(const ComRef &crefA, const ComRef &crefB, const Connector &conA, const Connector &conB)
Checks a connection based on SSP-1.0 connection table.
Definition: Connection.cpp:212
void dotExport(const std::string &filename)
Definition: DirectedGraph.cpp:101
bool sortedConnectionsAreValid
Definition: DirectedGraph.h:100