equal
deleted
inserted
replaced
713 /// graph. The graph is bi-node-connected if any two undirected edge is |
713 /// graph. The graph is bi-node-connected if any two undirected edge is |
714 /// on same circle. |
714 /// on same circle. |
715 /// |
715 /// |
716 /// \param graph The graph. |
716 /// \param graph The graph. |
717 /// \return %True when the graph bi-node-connected. |
717 /// \return %True when the graph bi-node-connected. |
718 /// \todo Make it faster. |
|
719 template <typename UGraph> |
718 template <typename UGraph> |
720 bool biNodeConnected(const UGraph& graph) { |
719 bool biNodeConnected(const UGraph& graph) { |
721 return countBiNodeConnectedComponents(graph) == 1; |
720 return countBiNodeConnectedComponents(graph) == 1; |
722 } |
721 } |
723 |
722 |
1040 /// graph is bi-edge-connected when any two nodes are connected with two |
1039 /// graph is bi-edge-connected when any two nodes are connected with two |
1041 /// edge-disjoint paths. |
1040 /// edge-disjoint paths. |
1042 /// |
1041 /// |
1043 /// \param graph The undirected graph. |
1042 /// \param graph The undirected graph. |
1044 /// \return The number of components. |
1043 /// \return The number of components. |
1045 /// \todo Make it faster. |
|
1046 template <typename UGraph> |
1044 template <typename UGraph> |
1047 bool biEdgeConnected(const UGraph& graph) { |
1045 bool biEdgeConnected(const UGraph& graph) { |
1048 return countBiEdgeConnectedComponents(graph) == 1; |
1046 return countBiEdgeConnectedComponents(graph) == 1; |
1049 } |
1047 } |
1050 |
1048 |