equal
deleted
inserted
replaced
747 /// This function checks whether the given undirected graph is |
747 /// This function checks whether the given undirected graph is |
748 /// bi-node-connected, i.e. a connected graph without articulation |
748 /// bi-node-connected, i.e. a connected graph without articulation |
749 /// node. |
749 /// node. |
750 /// |
750 /// |
751 /// \return \c true if the graph bi-node-connected. |
751 /// \return \c true if the graph bi-node-connected. |
752 /// \note By definition, the empty graph is bi-node-connected. |
752 /// |
|
753 /// \note By definition, |
|
754 /// \li a graph consisting of zero or one node is bi-node-connected, |
|
755 /// \li a graph consisting of two isolated nodes |
|
756 /// is \e not bi-node-connected and |
|
757 /// \li a graph consisting of two nodes connected by an edge |
|
758 /// is bi-node-connected. |
753 /// |
759 /// |
754 /// \see countBiNodeConnectedComponents(), biNodeConnectedComponents() |
760 /// \see countBiNodeConnectedComponents(), biNodeConnectedComponents() |
755 template <typename Graph> |
761 template <typename Graph> |
756 bool biNodeConnected(const Graph& graph) { |
762 bool biNodeConnected(const Graph& graph) { |
757 bool hasNonIsolated = false, hasIsolated = false; |
763 bool hasNonIsolated = false, hasIsolated = false; |