Package org.graph4j.connectivity
package org.graph4j.connectivity
Algorithms for analyzing connectivity of graphs and digraphs.
-
ClassDescriptionA bridge in an undirected graph is defined as an edge which, when removed, increases the number of connected components in the graph).Determines the connected components of a graph.Determines a maximum size set of edge disjoint paths between two vertices, a minimum size set of edges whose removal disconnects two vertices, the minimum cardinality edge cut and the edge connectivity number.Utility class for representing an edge cut.Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.Provides a method to find the minimum weighted cut of an undirected graph using the Stoer-Wagner algorithm.The algorithm for computing biconnected components in a connected undirected graph is due to John Hopcroft and Robert Tarjan (1973).Tarjan's strongly connected components algorithm is an algorithm in graph theory for finding the strongly connected components (SCCs) of a directed graph.Determines a maximum size set of vertex disjoint paths between two vertices, a minimum size set of vertices whose removal disconnects two vertices, the vertex connectivity number.