- Calc - Class in graph.math
-
Class containing basic math calculations needed for implementation
of various drawing algorithms
- Calc() - Constructor for class graph.math.Calc
-
- calculate(Graph<V, E>) - Method in class graph.symmetry.DeFrayseeixHeuristic
-
Calculates the heuristic
- calculateMaximumPlanarityGraph() - Method in class graph.algorithms.planarity.MaximumPlanaritySubgraph
-
- calculateOrdering(Graph<V, E>) - Static method in class graph.ordering.CanonicalOrdering
-
- calculateOrdering(Graph<V, E>) - Static method in class graph.ordering.TopologicalOrdering
-
Finds the topological ordering
- calculatePosition(List<V>, double, Point2D) - Method in class graph.math.CircleLayoutCalc
-
Calculates positions of the provided vertices so that they are apices of
of regular polygon and belonging to a circle with the provided center and radius
- calculateRadius(List<V>, double) - Method in class graph.math.CircleLayoutCalc
-
Calculates optimum radius of a circle on which centers of the provided vertices
should lay and where the distances between neighbouring vertices should not be
smaller than the provided value
- calculateVerticeDistances() - Method in class graph.math.CzekanovskiDiceDistance
-
Calculates Czekanovski-Dice distances between all vertices of a graph
- CannotBeAppliedException - Exception in graph.exception
-
Exception which is thrown when an algorithm cannot be applied (if the algorithm
wasn't designed for the graph in question)
- CannotBeAppliedException() - Constructor for exception graph.exception.CannotBeAppliedException
-
- CannotBeAppliedException(String) - Constructor for exception graph.exception.CannotBeAppliedException
-
- CanonicalOrdering - Class in graph.ordering
-
Canonical ordering is a technique for embedding a planar graph on a grid
To be implemented
- CanonicalOrdering() - Constructor for class graph.ordering.CanonicalOrdering
-
- childrenCount() - Method in class graph.tree.pq.PQTreeNode
-
Only used for P-nodes
- CircleLayoutCalc<V extends Vertex> - Class in graph.math
-
A class containing methods for calculating certain values needed by
the circular drawing algorithms
- CircleLayoutCalc() - Constructor for class graph.math.CircleLayoutCalc
-
- CircleLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.circle
-
Layotuer which embeds the vertices on a circle, with or without optimizing
edge crossings (depending on the optimize crossings parameter value).
- CircleLayouter() - Constructor for class graph.layout.circle.CircleLayouter
-
- CircleWithCenterLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.circle
-
This layouter takes places vertices on a circumference of a circle,
and places the vertex with the highest number of links with other graph vertices in
the center of the circle
- CircleWithCenterLayouter() - Constructor for class graph.layout.circle.CircleWithCenterLayouter
-
- Circular<V extends Vertex,E extends Edge<V>> - Class in graph.ordering.circular
-
An implementation of the algorithm CIRCULAR
which optimizes the number of edge crossings in circular drawings
- Circular(Graph<V, E>) - Constructor for class graph.ordering.circular.Circular
-
- circularNoCrossingsPath(V, V, Map<V, List<E>>, boolean, List<V>, List<E>) - Static method in class graph.traversal.TraversalUtil
-
Finds a path from one vertex to another such that the there are no back edges
and no edge crossings.
- circularOrdering() - Method in class graph.ordering.circular.Circular
-
Finds the ordering which minimizes the number of edge crossings in a circular
drawing
- compare(V, V) - Method in class graph.elements.VertexDegreeComparator
-
- Component<V extends Vertex,E extends Edge<V>> - Class in graph.properties.components
-
Class represent a component of a graph.
- Component() - Constructor for class graph.properties.components.Component
-
Construct a component with an empty list of edges
- Component(List<E>) - Constructor for class graph.properties.components.Component
-
Constructs a component and sets the edges
- containsDuplicates() - Method in class graph.elements.Path
-
Checks if there is at least one edge which occurs multiple times in
the path's list of edges
- containsEdge(E) - Method in class graph.elements.Path
-
Checks if the path contains a certain edge
- ConvexDrawing<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.drawing
-
Implementation of Chiba's convex drawing algorithm
Linear Algorithm for Convex Drawong of Planar Graphs
Norishige Chiba, Tadashi Yamanouchi, Takao Nishizeki
In Progress In Graph Theory, 1984.
- ConvexDrawing(Graph<V, E>) - Constructor for class graph.algorithms.drawing.ConvexDrawing
-
- ConvexLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.straight.line
-
A layouter which creates a drawing of a graph using Chiba's convex drawing algorithm
- ConvexLayouter() - Constructor for class graph.layout.straight.line.ConvexLayouter
-
- convexTesting() - Method in class graph.algorithms.drawing.PlanarConvexEmbedding
-
Determines if a 2-connected graph has a convex drawing
and finds an extendable facial cycle
- copyGraph(Graph<V, E>) - Static method in class graph.util.Util
-
Creates a copy of a graph
- cramers(double[][], double[]) - Static method in class graph.math.CramersRule
-
Given left-hand side equation matrix and right-hand side vector, solves
the system of equations
- CramersRule - Class in graph.math
-
A class which provides an implementation of Cramer's rule for solving
a system of equations
- CramersRule() - Constructor for class graph.math.CramersRule
-
- createEdge(V, V, Class<?>) - Static method in class graph.util.Util
-
Creates a graph edge between two vertices of the given class
- createLayouter(LayoutAlgorithms) - Method in class graph.layout.LayouterFactory
-
Creates the appropriate layouter instance
- createLRPartition() - Method in class graph.algorithms.lrpartition.LRPartition
-
An LR partition is a partition of the back edges into Left and Right so
that for every fork all return edges of e ending strictly
higher than lowpt(e2) belong to one partition, and all return edges of e2 ending strictly
higher than lowpt(e1) belong to the other.
- createLRPartition(DFSTree<V, E>) - Method in class graph.algorithms.lrpartition.LRPartition
-
- createNewEdge(V, V, Class<?>) - Method in class graph.operations.GraphOperations
-
Creates a new edge connecting two provided vertices
- createVertex(Class<?>) - Static method in class graph.util.Util
-
Creates a vertex of the given class
- CyclicPermutation<V extends Vertex> - Class in graph.symmetry
-
Class represents a permutation in the cyclic representation
- CyclicPermutation(List<V>, Permutation) - Constructor for class graph.symmetry.CyclicPermutation
-
- cyclicRepresenatation() - Method in class graph.symmetry.Permutation
-
Finds the cyclis representation of the permutation
- CyclicSymmetricGraphDrawing<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.drawing
-
Implementation of concentric symmetric drawing based on:
An Algorithm for Drawing Graphs Symmetrically
Hamish Carr and William Kocay
Bulletin of the Institute of Combinatorics and its Applications 27, 1999
- CyclicSymmetricGraphDrawing(Graph<V, E>) - Constructor for class graph.algorithms.drawing.CyclicSymmetricGraphDrawing
-
- CzekanovskiDiceDistance<V extends Vertex,E extends Edge<V>> - Class in graph.math
-
A class for calculating Czekanovski-Dice distances.
- CzekanovskiDiceDistance(Graph<V, E>) - Constructor for class graph.math.CzekanovskiDiceDistance
-