31 #ifndef adevs_lp_graph_h
32 #define adevs_lp_graph_h
54 if (E.find(A) == E.end()
55 && I.find(A) == I.end())
57 if (E.find(B) == E.end()
58 && I.find(B) == I.end())
66 const std::vector<int>&
getI(
int B) {
return I[B]; }
68 const std::vector<int>&
getE(
int A) {
return E[A]; }
75 std::map<int,std::vector<int> > E;
77 std::map<int,std::vector<int> > I;
LpGraph()
Create a graph without any edges.
Definition: adevs_lp_graph.h:50
Definition: adevs_lp_graph.h:46
~LpGraph()
Destructor.
Definition: adevs_lp_graph.h:70
const std::vector< int > & getI(int B)
Get the influencers of node B.
Definition: adevs_lp_graph.h:66
int getLPCount() const
Get the number of LPs.
Definition: adevs_lp_graph.h:64
void addEdge(int A, int B)
Create an edge from node A to node B.
Definition: adevs_lp_graph.h:52
const std::vector< int > & getE(int A)
Get the influencees of node A.
Definition: adevs_lp_graph.h:68