Uses of Package
org.graph4j
Packages that use org.graph4j
Package
Description
The main interfaces and classes for representing and using graphs.
Clique related algorithms, such as enumerating all maximal cliques of a graph.
Algorithms for the bandwith graph coloring problem.
Algorithms for the equitable graph coloring problem.
Algorithms for analyzing connectivity of graphs and digraphs.
Algorithms for determining eulerian circuits and trails.
Algorithms related to flows in transportation networks.
Graph generators of various kinds.
Reading and writing graphs in various formats.
Algorithms for testing graph isomorphism.
Algorithms for determining matchings, such as the maximum cardinality matching in bipartite graphs.
Classes responsible with calculating various graph measures (degrees, number of traingles, etc.).
Classes responsible with calculating various graph metrics (girth, radius, diameter, etc.).
Algorithms that produce various orderings of the vertices of a graph.
Algorithms for graph realization problems.
Algorithms related to paths and cycles.
Algorithms related to shortest paths, such as Dijkstra, Bellman-Ford, Floyd-Warshall, etc.
Minimum spanning tree algorithms, such as Prim's and Kruskal's.
Support algorithms for various type of graphs (bipartite, tournament, etc.).
Implementations of the depth-first search (DFS) and breadth-first search (BFS)
algorithms, using both iterator and visitor patterns.
Utility classes, such as apecialized collection for vertices and edges.
Algorithms for the Vertex Separator Problem (VSP).
-
Classes in org.graph4j used by org.graph4jClassDescriptionRepresents a directed graph.Multiple (parallel) edges are allowed.Multiple (parallel) edges are allowed.An edge is a pair of vertices.An iterator over all the edges of a graph.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Support class for creating a graph of any type.Multiple (parallel) edges are allowed.Enables iteration over the edges incident with a source vertex, returning one by one the neighbors of the source along with information regarding the corresponding edge.Represents a single commodity transportation (flow) network.Support class for creating transportation (flow) networks.Enables iteration over the edges incident to a target vertex, returning one by one the predecessors of the target along with information regarding the corresponding edge.Self loops and multiple (parallel) edges are allowed.Enables iteration over the edges incident from a source vertex, returning one by one the successors of the source along with information regarding the corresponding edge.An iterator over all the vertices of a graph.
-
Classes in org.graph4j used by org.graph4j.cliqueClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.coloringClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.coloring.bwClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.coloring.eqClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.connectivityClassDescriptionRepresents a directed graph.Abstract class for algorithms that accept only directed graphs as input.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.convertersClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.eulerianClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.
-
Classes in org.graph4j used by org.graph4j.flow
-
Classes in org.graph4j used by org.graph4j.generatorsClassDescriptionRepresents a directed graph.Multiple (parallel) edges are allowed.Multiple (parallel) edges are allowed.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Multiple (parallel) edges are allowed.Represents a single commodity transportation (flow) network.Self loops and multiple (parallel) edges are allowed.
-
Classes in org.graph4j used by org.graph4j.hamiltonianClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.ioClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.
-
Classes in org.graph4j used by org.graph4j.isomorphism
-
Classes in org.graph4j used by org.graph4j.matchingClassDescriptionAn edge is a pair of vertices.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.measuresClassDescriptionRepresents a directed graph.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only undirected graphs as input.
-
Classes in org.graph4j used by org.graph4j.metricsClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.
-
Classes in org.graph4j used by org.graph4j.orderingClassDescriptionRepresents a directed graph.Abstract class for algorithms that accept only directed graphs as input.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.Abstract class for algorithms that accept only simple graphs as input.
-
Classes in org.graph4j used by org.graph4j.realization
-
Classes in org.graph4j used by org.graph4j.routeClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.
-
Classes in org.graph4j used by org.graph4j.shortestpathClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.
-
Classes in org.graph4j used by org.graph4j.spanningClassDescriptionAn edge is a pair of vertices.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.
-
Classes in org.graph4j used by org.graph4j.supportClassDescriptionRepresents a directed graph.Abstract class for algorithms that accept only directed graphs as input.The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.Abstract class for algorithms that accept only undirected graphs as input.
-
Classes in org.graph4j used by org.graph4j.traversal
-
Classes in org.graph4j used by org.graph4j.util
-
Classes in org.graph4j used by org.graph4j.vspClassDescriptionThe base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Abstract class for algorithms that accept only simple graphs as input.