Packages

Package	Description
graph.algorithm	Classes used to execute an algorithm and measure the duration of the execution.
graph.algorithm.cycles	Classes for detecting cycles and finding a cycle basis of directed and undirected graphs.
graph.algorithms.connectivity	Classes related to the planar augmentation problem.
graph.algorithms.drawing	Implementations of various graph drawing algorithms.
graph.algorithms.interlacement	Elements of the interlacement graphs.
graph.algorithms.lrpartition	Classes related to LR partitions.
graph.algorithms.numbering	Classes represent different numberings of vertices.
graph.algorithms.planarity	Implementations of different planarity testing algorithms.
graph.algorithms.planarity.dual	Classes represent dual graph and its elements.
graph.drawing	Contains a class which represents results of the execution of layout algorithms.
graph.elements	Basic graph elements.
graph.elements.impl	Classes which implement edge and vertex interfaces in case they are needed to invoke any of the algorithms.
graph.enumerations	Enumerations needed to implement different algorithms
graph.exception	Exceptions thrown when an algorithm cannot be executed due to the graph not being of the right type or when a different error related to the input data is detected.
graph.layout	Layouters which are invoked in order to lay out graphs.
graph.layout.automatic	Classes for laying graphs automatically, based on their properties.
graph.layout.box	Simple layouter which places vertices on a table like structure.
graph.layout.circle	Layouters which use different circular layout algorithms.
graph.layout.dsl	Contains a class for laying out a graph based on the provided description which should be in accordance with the domain-specific language.
graph.layout.force.directed	Layouters which call different force-directed algorithms.
graph.layout.organic	Layouters which call different organic layout algorithms.
graph.layout.orthogonal	Layouters which use orthogonal drawing algorithms.
graph.layout.router.orthogonal	Classes responsible for routing edges as a part of the orthogonal drawing algorithms.
graph.layout.straight.line	Layouters which call different straight-line graph drawing algorithms.
graph.layout.symmetric	Layouters which call different symmetric graph drawing algorithms.
graph.layout.tree	Layouters which call different tree drawing algorithms.
graph.layout.util	Util classes needed by some layouters.
graph.math	Classes containing various mathematical calculations and mathematical objects.
graph.operations	Classes containing certain mathematical calculations involving two graphs, like their unions.
graph.ordering	Classes implementing different orderings of graph vertices.
graph.ordering.circular	Classes including an implementation of the algorithm CIRCULAR and necessary helper classes.
graph.properties	Classes containing methods for checking different properties of the given graph.
graph.properties.components	Classes representing split components and other elements associated with them, such as separation pairs.
graph.properties.splitting	Implementations of algorithms for splitting graph into bi- and triconnected components.
graph.symmetry	Classes related to graph's symmetries and automorphisms.
graph.symmetry.nauty	Classes needed to implement McKay's graph labeling algorithm.
graph.traversal	Classes implementing different graph traversal algorithms, like DFS and Dijkstra's shortest path.
graph.tree.bc	Classes representing a BC-tree and its elements.
graph.tree.binary	Classes representing a binary-tree and its elements.
graph.tree.pq	Classes representing a PQ-tree and its elements.
graph.tree.spqr	Classes representing a SPQR-tree and its elements.
graph.trees.dfs	Contains a class which represents a DFS tree.
graph.util	Helper classes.