equal
deleted
inserted
replaced
103 std::vector<Edge> ee; |
103 std::vector<Edge> ee; |
104 |
104 |
105 for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e); |
105 for(EdgeIt e(G);e!=INVALID;++e) ee.push_back(e); |
106 |
106 |
107 for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++) |
107 for(typename std::vector<Edge>::iterator p=ee.begin();p!=ee.end();p++) |
108 G.addEdge(G.head(*p),G.tail(*p)); |
108 G.addEdge(G.target(*p),G.source(*p)); |
109 } |
109 } |
110 |
110 |
111 |
111 |
112 /// \brief Checks the bidirectioned Petersen graph. |
112 /// \brief Checks the bidirectioned Petersen graph. |
113 /// |
113 /// |