- orbit(Integer) - Method in class graph.symmetry.Permutation
-
Finds he permutations orbit given a vertex
- orbit(Integer) - Method in class graph.symmetry.PermutationGroup
-
Finds an orbit of the group with resepct to a vertex
- order() - Method in class graph.symmetry.Permutation
-
Calculates the permutation's order
- OrderedPartition<V extends Vertex> - Class in graph.symmetry.nauty
-
Ordered partition, used in graph labeling algorithm
- OrderedPartition() - Constructor for class graph.symmetry.nauty.OrderedPartition
-
Creates an empty ordered partition
- OrderedPartition(List<V>...) - Constructor for class graph.symmetry.nauty.OrderedPartition
-
Create sand ordered partition consisting of one or more parts (lists pf vertices)
- OrderedPartition(List<List<V>>) - Constructor for class graph.symmetry.nauty.OrderedPartition
-
Creates a partition give its initial value
- orderValidUpToOnePartial() - Method in class graph.tree.pq.PQTreeNode
-
Checks if the order of the children is empty, singly partial, full
Some labels could be missing
Reversal is possible
- orderValidUpToTwoPartial() - Method in class graph.tree.pq.PQTreeNode
-
Checks if the order of the children is empty, singly partial, full, empty partial, empty
Some labels could be missing
Reversal is possible
- organizePartitions() - Method in class graph.algorithms.lrpartition.LRPartitionSet
-
Forms partitions
- organizeVerticesBySize(List<V>) - Method in class graph.math.CircleLayoutCalc
-
Sorts the given vertices by size
- OrthogonalConnector<V extends Vertex> - Class in graph.layout.router.orthogonal
-
Class represents a point where an edge begins or ends inside a vertex
Used to implement the orthogonal layout
- OrthogonalConnector(V, EntryDirection, int) - Constructor for class graph.layout.router.orthogonal.OrthogonalConnector
-
Creates a new orthogonal connector belonging to a certain vertex given
the entry direction and current number of edges
- OrthogonalEdgeRouter<V extends Vertex,E extends Edge<V>> - Class in graph.layout.router.orthogonal
-
Part of the orthogonal graph drawing algorithm.
- OrthogonalEdgeRouter(List<E>, Map<V, Point2D>, Map<E, Integer>, int) - Constructor for class graph.layout.router.orthogonal.OrthogonalEdgeRouter
-
Creates the edge router given list of edges to be positioned and vertices with their positions
- outDegree(V) - Method in class graph.elements.Graph
-
Out degree of the given node
- outEdges(V) - Method in class graph.elements.Graph
-
All edges leaving v