- AbstractForceDirectedLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.force.directed
-
Abstract class meant to be extended by others using JUNG framework's force-directed algorithms
- AbstractForceDirectedLayouter() - Constructor for class graph.layout.force.directed.AbstractForceDirectedLayouter
-
- AbstractJGraphXLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Contains general code used for calling JGraphX layout algorithms
- AbstractJGraphXLayouter() - Constructor for class graph.layout.AbstractJGraphXLayouter
-
- AbstractJungLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Contains general code used for calling Jung layout algorithms
- AbstractJungLayouter() - Constructor for class graph.layout.AbstractJungLayouter
-
- AbstractLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Abstract layouter class meant to be extended by all layouters.
- AbstractLayouter() - Constructor for class graph.layout.AbstractLayouter
-
- AbstractPrefuseLayouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout
-
Contains general code used for calling prefuse layout algorithms.
- AbstractPrefuseLayouter() - Constructor for class graph.layout.AbstractPrefuseLayouter
-
- AbstractTree<V extends Vertex,E extends Edge<V>> - Class in graph.tree.spqr
-
Abstract class, extended by SPQR tree and proto SPQR tree
- AbstractTree(E, Graph<V, E>) - Constructor for class graph.tree.spqr.AbstractTree
-
Constructors which sets the reference edge and graph for which the tree is being constructed
- add(List<E>, List<E>) - Method in class graph.algorithms.lrpartition.LRPartitionSet
-
Marks that all edges belonging to the first list should be in the same partition.
- addChild(Graph<V, E>) - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel
-
Adds child pendant to the label
- addChild(PQTreeNode) - Method in class graph.tree.pq.PQTreeNode
-
Adds a child node to the current node
- addChild(PQTreeNode, int) - Method in class graph.tree.pq.PQTreeNode
-
Adds child node to the current node at the specified index
- addChildNode(SPQRTreeNode<V, E>) - Method in class graph.tree.spqr.SPQRTreeNode
-
Adds a node to this node's list of children nodes
- addEdge(E) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
Adds a new edge to the block
- addEdge(E...) - Method in class graph.elements.Graph
-
- addEdge(E, EdgeDirection) - Method in class graph.elements.Path
-
Adds an edge to the path
- addEdge(List<Point2D>) - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- addEdge(E) - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
Adds an edge to the list of edges
- addEdge(PQTreeEdge...) - Method in class graph.tree.pq.PQTree
-
- addEdge(E, boolean) - Method in class graph.tree.spqr.Skeleton
-
- addPart(List<V>) - Method in class graph.symmetry.nauty.OrderedPartition
-
Adds a new part to the parition
- addToDifferent(Set<E>) - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
Marks the given edges as those that should be in the different partition
than the current edge
- addToSame(Set<E>) - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
Marks the given edges as those that should be in the same partition
as the current edge
- addTreeEdge(E) - Method in class graph.trees.dfs.DFSTree
-
- addTriangulatedEdge(V, V) - Method in class graph.ordering.circular.GraphCopy
-
Adds a triangulated edge between the given two vertices
- addVertex(V, boolean) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
Adds a new vertex to the block
- addVertex(V...) - Method in class graph.elements.Graph
-
- addVertex(V) - Method in class graph.elements.Graph
-
Add one vertex to the graph
- addVertex(BCTreeNode) - Method in class graph.tree.bc.BCTree
-
- addVertex(PQTreeNode) - Method in class graph.tree.pq.PQTree
-
- addVertex(V, int) - Method in class graph.trees.dfs.DFSTree
-
Adds vertex with the provided index to the tree
- addVertexBeginning(V) - Method in class graph.elements.Graph
-
Adds vertex as to the graph before any other vertex
- addVirtualEdge(E) - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
Adds a virtual edge - updates both the list of edges and virtual edges
- addVirualEdge(E) - Method in class graph.tree.spqr.Skeleton
-
Adds a new virtual edge
- adjacencyMap() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
Finds adjacency map of the component.
- adjacencyMatrix() - Method in class graph.elements.Graph
-
Calculates the adjacency matrix of the graph
- adjacentEdges(V) - Method in class graph.elements.Graph
-
- adjacentVertices(V) - Method in class graph.elements.Graph
-
All vertices adjacent to the given one
- adjacentVerticesWithTriangulated(V) - Method in class graph.ordering.circular.GraphCopy
-
Finds all vertices adjacent to the given vertex
taking triangulated edges into account as well
- AestheticCriteria - Enum in graph.layout
-
Lists aesthetic criteria in accordance to with the layout algorithms were designed
- AlgorithmErrorException - Exception in graph.properties.splitting
-
An exception thrown if an inconsistency is detected while performing an algorithm
Signalizes an implementation error.
- AlgorithmErrorException(String) - Constructor for exception graph.properties.splitting.AlgorithmErrorException
-
- AlgorithmExecutor - Class in graph.algorithm
-
Class used to generically execute any algorithm and measure how much time
it takes to do so
- AlgorithmExecutor() - Constructor for class graph.algorithm.AlgorithmExecutor
-
- allAdjacentEdgesWithTriangulated(V) - Method in class graph.ordering.circular.GraphCopy
-
Finds all edges adjacent to the given vertex
taking triangulated edges into account as well
- allDescendantsOf(PQTreeNode) - Method in class graph.tree.pq.PQTree
-
Finds all descendants of a tree node
- allDescendantsOf(V, boolean) - Method in class graph.trees.dfs.DFSTree
-
Returns all vertices that are descendants of vertex v in the tree
- allEdges(V) - Method in class graph.elements.Graph
-
All edges leaving or entering the given vertex
- allEdges(V) - Method in class graph.trees.dfs.DFSTree
-
- allIncomingBackEdges(V) - Method in class graph.trees.dfs.DFSTree
-
Finds all back edges entering the given vertex
- allOutgoingEdges(V) - Method in class graph.trees.dfs.DFSTree
-
Finds all edges (tree and back) leaving the given vertex
- allOutgoingTreeEdges(V) - Method in class graph.trees.dfs.DFSTree
-
Finds all edges starting from v and ending in a descendant of v (index of v is lower)
- angleBetweenTwoLines(Line, Line) - Static method in class graph.math.Calc
-
Finds angle between the two given lines
- AutomaticPropertiesLayout<V extends Vertex,E extends Edge<V>> - Class in graph.layout.automatic
-
Layouter which automatically picks and executes an algorithm
based on the properties of the given graph
- AutomaticPropertiesLayout() - Constructor for class graph.layout.automatic.AutomaticPropertiesLayout
-