- generateRandomGraph(int, Class<?>, int, Class<?>) - Static method in class graph.util.Util
-
Generates a random graph
- get(int, int) - Method in class graph.math.Matrix
-
Returns the value of a particular cell of the matrix
- get(int) - Method in class graph.math.Matrix
-
Returns contents of a row of the matrix
- getA() - Method in class graph.math.Triangle
-
- getA() - Method in class graph.properties.components.SeparationPair
-
- getA() - Method in class graph.properties.components.Triple
-
- getAdjacency() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getAdjacentLists() - Method in class graph.elements.Graph
-
- getAlgorithm() - Method in class graph.layout.Layouter
-
- getAllEdges() - Method in class graph.trees.dfs.DFSTree
-
- getAllFaces() - Method in class graph.algorithms.planarity.PlanarFaces
-
- getAllSelfLoopEdges() - Method in class graph.elements.Graph
-
All edges which connect one vertex to itself - loops
- getAllSinks() - Method in class graph.elements.Graph
-
Finds all sinks in the graph
- getAllSources() - Method in class graph.elements.Graph
-
Finds all sources in the graph
- getB() - Method in class graph.math.Triangle
-
- getB() - Method in class graph.properties.components.SeparationPair
-
- getB() - Method in class graph.properties.components.Triple
-
- getBackEdges() - Method in class graph.trees.dfs.DFSTree
-
- getBoundaryVertices() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- getBounds() - Method in class graph.drawing.Drawing
-
Calculates bounds of the drawing
- getbVertices() - Method in class graph.tree.bc.BCTree
-
- getC() - Method in class graph.math.Triangle
-
- getCentroid() - Method in class graph.math.Triangle
-
- getChildren() - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel
-
- getChildren() - Method in class graph.symmetry.nauty.SearchTreeNode
-
- getChildren() - Method in class graph.tree.pq.PQTreeNode
-
- getChildren() - Method in class graph.tree.spqr.SPQRTreeNode
-
- getColumn(double[][], int) - Static method in class graph.math.MatrixUtil
-
Extracts a column from a matrix
- getContent() - Method in class graph.algorithms.interlacement.InterlacementGraphVertex
-
- getContent() - Method in class graph.algorithms.planarity.dual.DualGraphVertex
-
- getContent() - Method in class graph.elements.impl.GraphVertex
-
- getContent() - Method in interface graph.elements.Vertex
-
- getContent() - Method in class graph.tree.bc.BCTreeNode
-
- getContent() - Method in class graph.tree.pq.PQTreeNode
-
- getContent() - Method in class graph.tree.spqr.SPQRTreeNode
-
- getContent() - Method in class graph.tree.spqr.TreeEdgeWithContent
-
- getCutVertex() - Method in class graph.properties.components.Block
-
- getCutVertices() - Method in class graph.properties.GraphProperties
-
Finds all cut vertices of a graph
- getcVertices() - Method in class graph.tree.bc.BCTree
-
- getCycle() - Method in class graph.symmetry.PermutationCycle
-
- getCycles() - Method in class graph.symmetry.CyclicPermutation
-
- getDefaultLayoutProperties(LayoutAlgorithms, Graph<?, ?>) - Static method in class graph.layout.DefaultGraphLayoutProperties
-
Sets default layout properties of the algorithm given a graph
- getDestination() - Method in class graph.algorithms.interlacement.InterlacementGraphEdge
-
- getDestination() - Method in class graph.algorithms.planarity.dual.DualGraphEdge
-
- getDestination() - Method in interface graph.elements.Edge
-
- getDestination() - Method in class graph.elements.impl.GraphEdge
-
- getDestination() - Method in class graph.ordering.circular.TriangulatedEdge
-
- getDestination() - Method in class graph.tree.bc.BCTreeEdge
-
- getDestination() - Method in class graph.tree.pq.PQTreeEdge
-
- getDestination() - Method in class graph.tree.spqr.TreeEdgeWithContent
-
- getDifferent() - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
- getDirections() - Method in class graph.elements.Path
-
- getDistance(V, V) - Method in class graph.math.CzekanovskiDiceDistance
-
Return the Czekanovski-Dice between two vertices
- getDuration() - Method in class graph.algorithm.ExecuteResult
-
- getEdge() - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
- getEdgeFacesMap() - Method in class graph.algorithms.planarity.PlanarFaces
-
- getEdgeMappings() - Method in class graph.drawing.Drawing
-
- getEdges() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- getEdges() - Method in class graph.elements.Graph
-
- getEdges() - Method in class graph.layout.Layouter
-
- getEdges() - Method in class graph.properties.components.Component
-
- getEdges() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- getEdgesWithNodePositions() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- getEigenValues() - Method in class graph.properties.GraphProperties
-
Finds the graph's eigen values
- getEmbedding() - Method in class graph.algorithms.planarity.Embedding
-
- getEmptyChildren() - Method in class graph.tree.pq.PQTreeNode
-
- getEntryDirection() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- geteXMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- getExternalFace() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- getExternalFaceEdges() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity
-
Return edges of the outside face
- geteYMaxMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- geteYMinMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- getFirstNontrivialPart() - Method in class graph.symmetry.nauty.OrderedPartition
-
Finds the first nontrivial part of the partition
- getFronds() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getFullChildren() - Method in class graph.tree.pq.PQTreeNode
-
- getgPrim() - Method in class graph.tree.spqr.ProtoSPQRTree
-
- getGraph() - Method in class graph.properties.components.Block
-
- getGraph() - Method in class graph.properties.components.SplitComponent
-
- getGraph() - Method in class graph.tree.spqr.ProtoSPQRTree
-
- getH() - Method in class graph.properties.components.Triple
-
- getHeight() - Method in class graph.tree.binary.BinaryTreeNode
-
- getHighestReturningEdge(E) - Method in class graph.trees.dfs.DFSTree
-
Finds the highest returning edge of a given edge
- getHighpt() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getIndex(V) - Method in class graph.trees.dfs.DFSTree
-
- getK() - Method in class graph.math.Line
-
- getKey() - Method in class graph.util.Pair
-
- getLabel() - Method in class graph.tree.pq.PQTreeNode
-
- getLayoutProperties() - Method in class graph.layout.Layouter
-
- getLeaves() - Method in class graph.tree.pq.PQTree
-
- getLeft() - Method in class graph.algorithms.lrpartition.LRPartition
-
Returns the left partition
- getLeft() - Method in class graph.tree.binary.BinaryTreeNode
-
- getLowpt1() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getMark() - Method in class graph.tree.pq.PQTreeNode
-
- getMessage() - Method in exception graph.exception.CannotBeAppliedException
-
- getMessage() - Method in exception graph.exception.DSLException
-
- getN() - Method in class graph.math.Line
-
- getName() - Method in enum graph.layout.PropertyEnums.BalloonProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.BoxProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.CircleProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.CompactTreeProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.FastOrganicProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.FruchtermanReingoldProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.HierarchicalProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.KamadaKawaiProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.NodeLinkTreeProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.OrganicProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.RadialTree2Properties
-
- getName() - Method in enum graph.layout.PropertyEnums.RadialTreeProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.SpringProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.SymmetricProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.TreeProperties
-
- getName() - Method in enum graph.layout.PropertyEnums.TutteProperties
-
- getNodePartition() - Method in class graph.symmetry.nauty.SearchTreeNode
-
- getNodes() - Method in class graph.tree.binary.BinaryTree
-
- getNodeType() - Method in class graph.tree.spqr.SPQRTreeNode
-
- getNumber() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- getNumbering() - Method in class graph.algorithms.numbering.STNumbering
-
- getOrder() - Method in class graph.algorithms.numbering.Numbering
-
Order of vertices
- getOrigin() - Method in class graph.algorithms.interlacement.InterlacementGraphEdge
-
- getOrigin() - Method in class graph.algorithms.planarity.dual.DualGraphEdge
-
- getOrigin() - Method in interface graph.elements.Edge
-
- getOrigin() - Method in class graph.elements.impl.GraphEdge
-
- getOrigin() - Method in class graph.ordering.circular.TriangulatedEdge
-
- getOrigin() - Method in class graph.tree.bc.BCTreeEdge
-
- getOrigin() - Method in class graph.tree.pq.PQTreeEdge
-
- getOrigin() - Method in class graph.tree.spqr.TreeEdgeWithContent
-
- getOutsideFace() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity
-
Return vertices of the outside face
- getParent() - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel
-
- getParent() - Method in class graph.symmetry.nauty.SearchTreeNode
-
- getParent() - Method in class graph.tree.bc.BCTreeNode
-
- getParent() - Method in class graph.tree.binary.BinaryTreeNode
-
- getParent() - Method in class graph.tree.pq.PQTreeNode
-
- getParentTriangle() - Method in class graph.math.Triangle
-
- getPartialChildren() - Method in class graph.tree.pq.PQTreeNode
-
- getPartition() - Method in class graph.symmetry.nauty.OrderedPartition
-
- getPath() - Method in class graph.elements.Path
-
- getPath(V, V) - Method in class graph.traversal.DijkstraAlgorithm
-
Finds a path in the given graph between two vertices if it exists.
- getPath(V, V, List<V>) - Method in class graph.traversal.DijkstraAlgorithm
-
Finds a path in the given graph between two vertices which doesn't contain
certain specified vertices, if one exists.
- getPaths() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
- getPendants() - Method in class graph.tree.bc.BCTree
-
- getPermutation() - Method in class graph.symmetry.Permutation
-
- getPermutations() - Method in class graph.symmetry.PermutationGroup
-
- getPertinendChildCount() - Method in class graph.tree.pq.PQTreeNode
-
- getPertinentLeafCount() - Method in class graph.tree.pq.PQTreeNode
-
- getPlanarEmbedding() - Method in class graph.algorithms.planarity.PlanarFaces
-
- getPlanarSubgraph() - Method in class graph.algorithms.planarity.MaximumPlanaritySubgraph
-
- getpNodes() - Method in class graph.tree.pq.PQTree
-
- getPositionsMap() - Method in class graph.layout.util.PositionAction
-
Returns the positions of graph's nodes
- getProperty(PropertyEnums) - Method in class graph.layout.GraphLayoutProperties
-
Return value of the property given its key
- getqNodes() - Method in class graph.tree.pq.PQTree
-
- getReferenceEdge() - Method in class graph.tree.spqr.ProtoSPQRTree
-
- getReursiveLinkDistance() - Method in class graph.drawing.Drawing
-
- getReversalNum() - Method in class graph.tree.pq.PQTreeReduction
-
- getRight() - Method in class graph.algorithms.lrpartition.LRPartition
-
Returns the right partition
- getRight() - Method in class graph.tree.binary.BinaryTreeNode
-
- getRoot() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- getRoot() - Method in class graph.symmetry.nauty.SearchTree
-
- getRoot() - Method in class graph.tree.bc.BCTree
-
- getRoot() - Method in class graph.tree.binary.BinaryTree
-
- getRoot() - Method in class graph.tree.pq.PQTree
-
- getRoot() - Method in class graph.tree.spqr.AbstractTree
-
- getRoot() - Method in class graph.tree.spqr.ProtoSPQRTree
-
- getRoot() - Method in class graph.trees.dfs.DFSTree
-
- getS() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- getSame() - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
- getSeparationPairEndVertices() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getSeparationPairs() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
- getSeparationPairs() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getSeparationPairStartVertices() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getSeparationPairVirtuelEdgeMap() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
- getSize() - Method in class graph.algorithms.interlacement.InterlacementGraphVertex
-
- getSize() - Method in class graph.algorithms.planarity.dual.DualGraphVertex
-
- getSize() - Method in class graph.elements.impl.GraphVertex
-
- getSize() - Method in interface graph.elements.Vertex
-
- getSize() - Method in class graph.tree.bc.BCTreeNode
-
- getSize() - Method in class graph.tree.pq.PQTreeNode
-
- getSize() - Method in class graph.tree.spqr.SPQRTreeNode
-
- getSkeleton() - Method in class graph.tree.spqr.SPQRTreeNode
-
- getSpearaionPair() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- getSplitComponents() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
- getSplitPair() - Method in class graph.properties.components.SplitComponent
-
- getSplittingList() - Method in class graph.symmetry.nauty.SearchTreeNode
-
- getsStar() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- getStNumbering() - Method in class graph.algorithms.planarity.Embedding
-
- getStNumbers() - Method in class graph.algorithms.planarity.PQTreePlanarity
-
- getStOrder() - Method in class graph.algorithms.planarity.PQTreePlanarity
-
- getT() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- getTerminalNodes() - Method in class graph.symmetry.nauty.SearchTree
-
Finds all terminal nodes
- getTree() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getTreeEdges() - Method in class graph.properties.splitting.SeparationPairSplitting
-
- getTreeEdges() - Method in class graph.trees.dfs.DFSTree
-
- getTreeLeaves(V) - Method in class graph.elements.Graph
-
- gettStar() - Method in class graph.algorithms.planarity.dual.STDualGraph
-
- getType() - Method in class graph.algorithms.connectivity.PlanarAugmentationLabel
-
- getType() - Method in enum graph.layout.PropertyEnums.BalloonProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.BoxProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.CircleProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.CompactTreeProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.FastOrganicProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.FruchtermanReingoldProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.HierarchicalProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.KamadaKawaiProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.NodeLinkTreeProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.OrganicProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.RadialTree2Properties
-
- getType() - Method in enum graph.layout.PropertyEnums.RadialTreeProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.SpringProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.SymmetricProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.TreeProperties
-
- getType() - Method in enum graph.layout.PropertyEnums.TutteProperties
-
- getType() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- getType() - Method in class graph.properties.components.SeparationPair
-
- getType() - Method in class graph.properties.components.SplitPair
-
- getType() - Method in class graph.tree.bc.BCTreeNode
-
- getType() - Method in class graph.tree.pq.PQTreeNode
-
- getU() - Method in class graph.properties.components.SplitPair
-
- getUniqueVertices() - Method in class graph.elements.Path
-
- getUpwardsEmbedding() - Method in class graph.algorithms.planarity.PQTreePlanarity
-
- getV() - Method in class graph.properties.components.SplitPair
-
- getValue() - Method in class graph.algorithm.ExecuteResult
-
- getValue() - Method in class graph.util.Pair
-
- getVertex() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
- getVertex() - Method in class graph.tree.binary.BinaryTreeNode
-
- getVertexByContent(Object) - Method in class graph.elements.Graph
-
Return a vertex with the provided content
- getVertexMappings() - Method in class graph.drawing.Drawing
-
- getVertices() - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity.Block
-
- getVertices() - Method in class graph.elements.Graph
-
- getVertices() - Method in class graph.layout.Layouter
-
- getVertices() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- getVerticesInOrder() - Method in class graph.symmetry.nauty.OrderedPartition
-
Forms a list of all vertices of the partition from the first
to the last one
- getVerticesWithIndexes() - Method in class graph.trees.dfs.DFSTree
-
- getVirtualEdge() - Method in class graph.tree.pq.PQTreeNode
-
- getVirtualEdges() - Method in class graph.properties.components.HopcroftTarjanSplitComponent
-
- getVirtualEdges() - Method in class graph.properties.splitting.HopcroftTarjanSplitting
-
- getVirtualEdges() - Method in class graph.tree.spqr.Skeleton
-
- getvXMaxMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- getvXMinMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- getvYMap() - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
- getWeight() - Method in class graph.algorithms.interlacement.InterlacementGraphEdge
-
- getWeight() - Method in class graph.algorithms.planarity.dual.DualGraphEdge
-
- getWeight() - Method in interface graph.elements.Edge
-
- getWeight() - Method in class graph.elements.impl.GraphEdge
-
- getWeight() - Method in class graph.ordering.circular.TriangulatedEdge
-
- getWeight() - Method in class graph.tree.bc.BCTreeEdge
-
- getWeight() - Method in class graph.tree.pq.PQTreeEdge
-
- getWeight() - Method in class graph.tree.spqr.TreeEdgeWithContent
-
- GramSchmidt - Class in graph.math
-
Implementation of the GramSchmidt process
Given a matrix A, representing a set of base vectors
calculates the orthonormal basis
- GramSchmidt() - Constructor for class graph.math.GramSchmidt
-
- Graph<V extends Vertex,E extends Edge<V>> - Class in graph.elements
-
/**
A graph consisting of a set of vertices of type V
and a set of edges of type E.
- Graph() - Constructor for class graph.elements.Graph
-
Creates a graph by creating empty lists of edges, vertices and other properties
By default, the graph is undirected
- Graph(List<V>, List<E>) - Constructor for class graph.elements.Graph
-
- Graph(boolean) - Constructor for class graph.elements.Graph
-
Creates a directed or undirected graph, depending on the provided parameter value
- graph.algorithm - package graph.algorithm
-
Classes used to execute an algorithm and measure the duration of the execution.
- graph.algorithm.cycles - package graph.algorithm.cycles
-
Classes for detecting cycles and finding a cycle basis of directed and undirected graphs.
- graph.algorithms.connectivity - package graph.algorithms.connectivity
-
Classes related to the planar augmentation problem.
- graph.algorithms.drawing - package graph.algorithms.drawing
-
Implementations of various graph drawing algorithms.
- graph.algorithms.interlacement - package graph.algorithms.interlacement
-
Elements of the interlacement graphs.
- graph.algorithms.lrpartition - package graph.algorithms.lrpartition
-
Classes related to LR partitions.
- graph.algorithms.numbering - package graph.algorithms.numbering
-
Classes represent different numberings of vertices.
- graph.algorithms.planarity - package graph.algorithms.planarity
-
Implementations of different planarity testing algorithms.
- graph.algorithms.planarity.dual - package graph.algorithms.planarity.dual
-
Classes represent dual graph and its elements.
- graph.drawing - package graph.drawing
-
Contains a class which represents results of the execution of layout algorithms.
- graph.elements - package graph.elements
-
Basic graph elements.
- graph.elements.impl - package graph.elements.impl
-
Classes which implement edge and vertex interfaces in case they are needed to
invoke any of the algorithms.
- graph.enumerations - package graph.enumerations
-
Enumerations needed to implement different algorithms
- graph.exception - package 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 - package graph.layout
-
Layouters which are invoked in order to lay out graphs.
- graph.layout.automatic - package graph.layout.automatic
-
Classes for laying graphs automatically, based on their properties.
- graph.layout.box - package graph.layout.box
-
Simple layouter which places vertices on a table like structure.
- graph.layout.circle - package graph.layout.circle
-
Layouters which use different circular layout algorithms.
- graph.layout.dsl - package 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 - package graph.layout.force.directed
-
Layouters which call different force-directed algorithms.
- graph.layout.organic - package graph.layout.organic
-
Layouters which call different organic layout algorithms.
- graph.layout.orthogonal - package graph.layout.orthogonal
-
Layouters which use orthogonal drawing algorithms.
- graph.layout.router.orthogonal - package graph.layout.router.orthogonal
-
Classes responsible for routing edges as a part of the orthogonal drawing algorithms.
- graph.layout.straight.line - package graph.layout.straight.line
-
Layouters which call different straight-line graph drawing algorithms.
- graph.layout.symmetric - package graph.layout.symmetric
-
Layouters which call different symmetric graph drawing algorithms.
- graph.layout.tree - package graph.layout.tree
-
Layouters which call different tree drawing algorithms.
- graph.layout.util - package graph.layout.util
-
Util classes needed by some layouters.
- graph.math - package graph.math
-
Classes containing various mathematical calculations and mathematical objects.
- graph.operations - package graph.operations
-
Classes containing certain mathematical calculations involving two graphs,
like their unions.
- graph.ordering - package graph.ordering
-
Classes implementing different orderings of graph vertices.
- graph.ordering.circular - package graph.ordering.circular
-
Classes including an implementation of the algorithm CIRCULAR and necessary helper classes.
- graph.properties - package graph.properties
-
Classes containing methods for checking different properties of the given graph.
- graph.properties.components - package graph.properties.components
-
Classes representing split components and other elements associated with them, such as separation pairs.
- graph.properties.splitting - package graph.properties.splitting
-
Implementations of algorithms for splitting graph into bi- and triconnected components.
- graph.symmetry - package graph.symmetry
-
Classes related to graph's symmetries and automorphisms.
- graph.symmetry.nauty - package graph.symmetry.nauty
-
Classes needed to implement McKay's graph labeling algorithm.
- graph.traversal - package graph.traversal
-
Classes implementing different graph traversal algorithms, like DFS and Dijkstra's shortest path.
- graph.tree.bc - package graph.tree.bc
-
Classes representing a BC-tree and its elements.
- graph.tree.binary - package graph.tree.binary
-
Classes representing a binary-tree and its elements.
- graph.tree.pq - package graph.tree.pq
-
Classes representing a PQ-tree and its elements.
- graph.tree.spqr - package graph.tree.spqr
-
Classes representing a SPQR-tree and its elements.
- graph.trees.dfs - package graph.trees.dfs
-
Contains a class which represents a DFS tree.
- graph.util - package graph.util
-
Helper classes.
- GraphCopy<V extends Vertex,E extends Edge<V>> - Class in graph.ordering.circular
-
A graph containing triangulated edges.
- GraphCopy() - Constructor for class graph.ordering.circular.GraphCopy
-
- GraphCopy(List<V>, List<E>) - Constructor for class graph.ordering.circular.GraphCopy
-
- GraphEdge - Class in graph.elements.impl
-
A class which implements the Edge interface.
- GraphEdge() - Constructor for class graph.elements.impl.GraphEdge
-
- GraphEdge(GraphVertex, GraphVertex, int) - Constructor for class graph.elements.impl.GraphEdge
-
Creates an edge with the specified origin vertex, destination vertex and weight
- GraphEdge(GraphVertex, GraphVertex) - Constructor for class graph.elements.impl.GraphEdge
-
Creates an edge with the specified origin and destination vertices
- GraphLayoutProperties - Class in graph.layout
-
Class containing a map of layout properties and their values
as well as convenience methods for setting and getting values
of the properties
- GraphLayoutProperties() - Constructor for class graph.layout.GraphLayoutProperties
-
- graphMaxDegree() - Method in class graph.elements.Graph
-
Max vertex degree
- GraphOperations<V extends Vertex,E extends Edge<V>> - Class in graph.operations
-
A class containing util methods, mostly regarding
operations between two graphs
- GraphOperations() - Constructor for class graph.operations.GraphOperations
-
- GraphProperties<V extends Vertex,E extends Edge<V>> - Class in graph.properties
-
A class containing methods for checking various properties
of the given graph
- GraphProperties(Graph<V, E>) - Constructor for class graph.properties.GraphProperties
-
- GraphTraversal - Class in graph.traversal
-
Contains methods which implement certain graph traversal algorithms
- GraphTraversal() - Constructor for class graph.traversal.GraphTraversal
-
- GraphVertex - Class in graph.elements.impl
-
A class which implements the Vertex interface
- GraphVertex() - Constructor for class graph.elements.impl.GraphVertex
-
- GraphVertex(Dimension, Object) - Constructor for class graph.elements.impl.GraphVertex
-
Creates a vertex with the provided size and content
- GraphVertex(Dimension) - Constructor for class graph.elements.impl.GraphVertex
-
Creates a vertex with the provided size