| Package | Description |
|---|---|
| graph.algorithms.connectivity |
Classes related to the planar augmentation problem.
|
| graph.algorithms.drawing |
Implementations of various graph drawing algorithms.
|
| graph.algorithms.planarity |
Implementations of different planarity testing algorithms.
|
| graph.layout |
Layouters which are invoked in order to lay out graphs.
|
| graph.ordering |
Classes implementing different orderings of graph vertices.
|
| graph.tree.spqr |
Classes representing a SPQR-tree and its elements.
|
| Modifier and Type | Method and Description |
|---|---|
java.util.List<E> |
PlanarAugmentation.planarBiconnected(Graph<V,E> graph)
Finds edges which need to be added in order to transform the graph into a planar
biconnected one.
|
| Modifier and Type | Method and Description |
|---|---|
Path<V,E> |
PlanarConvexEmbedding.convexTesting()
Determines if a 2-connected graph has a convex drawing
and finds an extendable facial cycle
|
| Modifier and Type | Method and Description |
|---|---|
static <V extends Vertex,E extends Edge<V>> |
PlanarEmbedding.emedGraph(Graph<V,E> graph,
V s,
V t)
Calculates a planar embedding of a graph based on the work of Chiba, Nishizeki, Abe and Ozava
A linear algorithm for embedding planar graphs using PQ-trees, Journal of Computer and System Sciences 30, 1985
|
void |
PlanarFaces.formFaces(V s,
V t)
Runs the algorithm for forming planar faces
|
| Modifier and Type | Method and Description |
|---|---|
Drawing<V,E> |
Layouter.layout()
Lays out the graph and returns an instance of the drawing object
|
| Modifier and Type | Method and Description |
|---|---|
static <V extends Vertex,E extends Edge<V>> |
TopologicalOrdering.calculateOrdering(Graph<V,E> graph)
Finds the topological ordering
|
static <V extends Vertex,E extends Edge<V>> |
CanonicalOrdering.calculateOrdering(Graph<V,E> graph) |
| Constructor and Description |
|---|
SPQRTree(E referenceEdge,
Graph<V,E> graph)
Constructs a SPQR tree of the given graph
|