31 #ifndef __adevs_simpledigraph_h_
32 #define __adevs_simpledigraph_h_
74 std::map<Component*,Bag<Component*> > graph;
77 template <
class VALUE,
class T>
80 assert(model !=
this);
85 template <
class VALUE,
class T>
88 if (src !=
this) add(src);
89 if (dst !=
this) add(dst);
90 graph[src].insert(dst);
93 template <
class VALUE,
class T>
99 template <
class VALUE,
class T>
105 typename std::map<Component*,Bag<Component*> >::iterator graph_iter;
106 graph_iter = graph.find(model);
108 if (graph_iter == graph.end())
return;
112 for (node_iter = (*graph_iter).second.begin();
113 node_iter != (*graph_iter).second.end(); node_iter++)
115 event.model = *node_iter;
121 template <
class VALUE,
class T>
125 for (i = models.begin(); i != models.end(); i++)