Package org.graph4j.util
package org.graph4j.util
Utility classes, such as apecialized collection for vertices and edges.
-
ClassDescriptionA block of a graph is a maximal 2-connected subgraph (it has no cut vertex).A circuit is a trail whose last vertex is connected to the first one.A clique is a set of vertices of a graph such that any two of them are adjacent.A cycle is a closed path, meaning that the last vertex of the path is connected to the first one.A domain of available non-negative values for a vertex.Deprecated.A set of edges in a graph.Utility class for working with arrays of integers.Adapted after the implementation of IntHashMap in Apache Commons Collection.An iterator over a collection of primitive integers.A matching or independent edge set is a set of edges without common vertices.Pair<K,
V> Utility class describing a generic pair of values.A path is a trail with no duplicate vertices.Radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.Utility class representing a tree with a node designated as root.A stable set is a set of vertices of a graph, no two of which are adjacent.Iterates over all subsets of the set {0,1,...,n-1}.Utility methods.A trail is a walk with no repeated edge.A union-find data structure (also called disjoint-set or merge–find) stores a collection of disjoint (non-overlapping) sets.Utility class for performing various checks related to graphs.A collection of vertices in a graph.Implementation of a binary min heap using arrays.A list of vertices of a graph.VertexPartition<T extends VertexCollection>Deprecated.A queue of vertices of a graph.A set of vertices of a graph.A stack of vertices in a graph.A walk is a sequence of graph vertices such that any two consecutive vertices form an edge of the graph.