std11::shared_ptr<S> setOfGraph(std11::shared_ptr<G> g)
{
std11::shared_ptr<S> r;
r.reset(new S());
for (typename G::VIterator vi = g->begin(); vi != g->end(); ++vi)
{
r->insert(g->bundle(*vi));
}
return(r);
}
void update()
{
vertices.clear();
edges.clear();
InteractionsGraph::VIterator ui, uiend;
for (boost::tie(ui,uiend) = graph->vertices(); ui != uiend; ++ui)
{
vertices.push_back(graph->bundle(*ui));
};
InteractionsGraph::EIterator ei, eiend;
for (boost::tie(ei,eiend) = graph->edges(); ei != eiend; ++ei)
{
edges.push_back(graph->bundle(*ei));
};
};