- isConnected
Test if the inspected graph is connected. A graph is connected when, while
ignoring edge directional
- isSimple
Check if a graph is simple. A graph is simple if it has no self-loops and
multiple (parallel) edges.
- requireUndirected
Checks that the specified graph is undirected and throws a customized
IllegalArgumentException if it
- hasMultipleEdges
Check if a graph has multiple edges (parallel edges), that is, whether the graph
contains two or mor
- hasOreProperty
Tests whether an undirected graph meets Ore's condition to be Hamiltonian. Let
$G$ be a (finite and
- isBipartite
Test whether a graph is bipartite.
- isBipartitePartition
Test whether a partition of the vertices into two sets is a bipartite partition.
- isComplete
Test whether a graph is complete. A complete undirected graph is a simple graph
in which every pair
- isEmpty
Test whether a graph is empty. An empty graph on n nodes consists of n isolated
vertices with no edg
- isForest
Test whether an undirected graph is a forest. A forest is a set of disjoint
trees. By definition, an
- requireDirected
Checks that the specified graph is directed and throws a customized
IllegalArgumentException if it i
- requireDirectedOrUndirected
Checks that the specified graph is directed or undirected and throws a
customized IllegalArgumentExc