dinoq-utility 3.5.0 API
Packages
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.
Examples of using Graph4J to model various problems.
Contains common exception classes that may be thrown by various algorithms.
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).