Changeset 2429:fd51b552bcf2 in lemon0.x for lemon/topology.h
 Timestamp:
 04/20/07 16:49:21 (13 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3265
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/topology.h
r2421 r2429 36 36 #include <functional> 37 37 38 /// \ingroup topology38 /// \ingroup graph_prop 39 39 /// \file 40 40 /// \brief Topology related algorithms … … 44 44 namespace lemon { 45 45 46 /// \ingroup topology46 /// \ingroup graph_prop 47 47 /// 48 48 /// \brief Check that the given undirected graph is connected. … … 67 67 } 68 68 69 /// \ingroup topology69 /// \ingroup graph_prop 70 70 /// 71 71 /// \brief Count the number of connected components of an undirected graph … … 109 109 } 110 110 111 /// \ingroup topology111 /// \ingroup graph_prop 112 112 /// 113 113 /// \brief Find the connected components of an undirected graph … … 232 232 233 233 234 /// \ingroup topology234 /// \ingroup graph_prop 235 235 /// 236 236 /// \brief Check that the given directed graph is strongly connected. … … 288 288 } 289 289 290 /// \ingroup topology290 /// \ingroup graph_prop 291 291 /// 292 292 /// \brief Count the strongly connected components of a directed graph … … 352 352 } 353 353 354 /// \ingroup topology354 /// \ingroup graph_prop 355 355 /// 356 356 /// \brief Find the strongly connected components of a directed graph … … 422 422 } 423 423 424 /// \ingroup topology424 /// \ingroup graph_prop 425 425 /// 426 426 /// \brief Find the cut edges of the strongly connected components. … … 706 706 int countBiNodeConnectedComponents(const UGraph& graph); 707 707 708 /// \ingroup topology708 /// \ingroup graph_prop 709 709 /// 710 710 /// \brief Checks the graph is binodeconnected. … … 722 722 } 723 723 724 /// \ingroup topology724 /// \ingroup graph_prop 725 725 /// 726 726 /// \brief Count the biconnected components. … … 757 757 } 758 758 759 /// \ingroup topology759 /// \ingroup graph_prop 760 760 /// 761 761 /// \brief Find the binodeconnected components. … … 803 803 } 804 804 805 /// \ingroup topology805 /// \ingroup graph_prop 806 806 /// 807 807 /// \brief Find the binodeconnected cut nodes. … … 1033 1033 int countBiEdgeConnectedComponents(const UGraph& graph); 1034 1034 1035 /// \ingroup topology1035 /// \ingroup graph_prop 1036 1036 /// 1037 1037 /// \brief Checks that the graph is biedgeconnected. … … 1049 1049 } 1050 1050 1051 /// \ingroup topology1051 /// \ingroup graph_prop 1052 1052 /// 1053 1053 /// \brief Count the biedgeconnected components. … … 1084 1084 } 1085 1085 1086 /// \ingroup topology1086 /// \ingroup graph_prop 1087 1087 /// 1088 1088 /// \brief Find the biedgeconnected components. … … 1129 1129 } 1130 1130 1131 /// \ingroup topology1131 /// \ingroup graph_prop 1132 1132 /// 1133 1133 /// \brief Find the biedgeconnected cut edges. … … 1193 1193 } 1194 1194 1195 /// \ingroup topology1195 /// \ingroup graph_prop 1196 1196 /// 1197 1197 /// \brief Sort the nodes of a DAG into topolgical order. … … 1232 1232 } 1233 1233 1234 /// \ingroup topology1234 /// \ingroup graph_prop 1235 1235 /// 1236 1236 /// \brief Sort the nodes of a DAG into topolgical order. … … 1284 1284 } 1285 1285 1286 /// \ingroup topology1286 /// \ingroup graph_prop 1287 1287 /// 1288 1288 /// \brief Check that the given directed graph is a DAG. … … 1326 1326 } 1327 1327 1328 /// \ingroup topology1328 /// \ingroup graph_prop 1329 1329 /// 1330 1330 /// \brief Check that the given undirected graph is acyclic. … … 1360 1360 } 1361 1361 1362 /// \ingroup topology1362 /// \ingroup graph_prop 1363 1363 /// 1364 1364 /// \brief Check that the given undirected graph is tree. … … 1452 1452 } 1453 1453 1454 /// \ingroup topology1454 /// \ingroup graph_prop 1455 1455 /// 1456 1456 /// \brief Check if the given undirected graph is bipartite or not … … 1491 1491 } 1492 1492 1493 /// \ingroup topology1493 /// \ingroup graph_prop 1494 1494 /// 1495 1495 /// \brief Check if the given undirected graph is bipartite or not
Note: See TracChangeset
for help on using the changeset viewer.