equal
deleted
inserted
replaced
1415 } |
1415 } |
1416 for(EdgeIt i(graph);i!=INVALID;++i){ |
1416 for(EdgeIt i(graph);i!=INVALID;++i){ |
1417 if(bfs.dist(graph.source(i))==bfs.dist(graph.target(i)))return false; |
1417 if(bfs.dist(graph.source(i))==bfs.dist(graph.target(i)))return false; |
1418 } |
1418 } |
1419 return true; |
1419 return true; |
1420 }; |
1420 } |
1421 |
1421 |
1422 /// \ingroup topology |
1422 /// \ingroup topology |
1423 /// |
1423 /// |
1424 /// \brief Check if the given undirected graph is bipartite or not |
1424 /// \brief Check if the given undirected graph is bipartite or not |
1425 /// |
1425 /// |
1457 } |
1457 } |
1458 for(EdgeIt i(graph);i!=INVALID;++i){ |
1458 for(EdgeIt i(graph);i!=INVALID;++i){ |
1459 if(bfs.dist(graph.source(i)) == bfs.dist(graph.target(i)))return false; |
1459 if(bfs.dist(graph.source(i)) == bfs.dist(graph.target(i)))return false; |
1460 } |
1460 } |
1461 return true; |
1461 return true; |
1462 }; |
1462 } |
1463 |
1463 |
1464 } //namespace lemon |
1464 } //namespace lemon |
1465 |
1465 |
1466 #endif //LEMON_TOPOLOGY_H |
1466 #endif //LEMON_TOPOLOGY_H |