-
Notifications
You must be signed in to change notification settings - Fork 49
/
DirectedGraph.h
104 lines (87 loc) · 3 KB
/
DirectedGraph.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/*
* This file is part of OpenModelica.
*
* Copyright (c) 1998-CurrentYear, Open Source Modelica Consortium (OSMC),
* c/o Linköpings universitet, Department of Computer and Information Science,
* SE-58183 Linköping, Sweden.
*
* All rights reserved.
*
* THIS PROGRAM IS PROVIDED UNDER THE TERMS OF GPL VERSION 3 LICENSE OR
* THIS OSMC PUBLIC LICENSE (OSMC-PL) VERSION 1.2.
* ANY USE, REPRODUCTION OR DISTRIBUTION OF THIS PROGRAM CONSTITUTES
* RECIPIENT'S ACCEPTANCE OF THE OSMC PUBLIC LICENSE OR THE GPL VERSION 3,
* ACCORDING TO RECIPIENTS CHOICE.
*
* The OpenModelica software and the Open Source Modelica
* Consortium (OSMC) Public License (OSMC-PL) are obtained
* from OSMC, either from the above address,
* from the URLs: http://www.ida.liu.se/projects/OpenModelica or
* http://www.openmodelica.org, and in the OpenModelica distribution.
* GNU version 3 is obtained from: http://www.gnu.org/copyleft/gpl.html.
*
* This program is distributed WITHOUT ANY WARRANTY; without
* even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE, EXCEPT AS EXPRESSLY SET FORTH
* IN THE BY RECIPIENT SELECTED SUBSIDIARY LICENSE CONDITIONS OF OSMC-PL.
*
* See the full OSMC Public License conditions for more details.
*
*/
#ifndef _OMS_DIRECTED_GRAPH_H_
#define _OMS_DIRECTED_GRAPH_H_
#include "ComRef.h"
#include "Connector.h"
#include "Variable.h"
#include <deque>
#include <fmilib.h>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
namespace oms
{
/**
* @brief Strong connected components data type.
*
* A vector of pairs of connected components.
*/
struct scc_t
{
std::vector< std::pair<int, int> > connections;
bool thisIsALoop; // needed because a SSC with just one connection can be a loop! fmu.y -> fmu.u
unsigned int size;
unsigned int size_including_internal;
std::set<oms::ComRef> component_names;
double factor;
};
class DirectedGraph
{
public:
DirectedGraph();
~DirectedGraph();
void clear();
int addNode(const Connector& var);
void addEdge(const Connector& var1, const Connector& var2);
void dotExport(const std::string& filename);
void includeGraph(const DirectedGraph& graph, const ComRef& prefix);
const std::vector< scc_t >& getSortedConnections();
const std::vector<Connector>& getNodes() const {return nodes;}
const scc_t& getEdges() const {return edges;}
void setUnits(Connector* conA, Connector* conB);
void dumpNodes() const;
private:
std::deque< std::vector<int> > getSCCs();
void calculateSortedConnections();
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);
static int getEdgeIndex(const scc_t& edges, int from, int to);
private:
std::vector<Connector> nodes;
scc_t edges;
std::vector< std::vector<int> > G;
std::vector< scc_t > sortedConnections;
bool sortedConnectionsAreValid;
};
}
#endif