33 std::set < Node * > adj;
35 __depthFirstSearchNodes.insert (__n);
36 for ( std::set < Node * >::const_iterator it = adj.begin();
39 if ( __depthFirstSearchNodes.find(*it) == __depthFirstSearchNodes.end())
void AdjacentNodes(std::set< int > &__adjacentNodes)
void HYPERGRAPHLIB_ITEM dfs(Node *__n, std::set< Node * > &__depthFirstSearchNodes)