- incNumber() - Method in class graph.layout.router.orthogonal.OrthogonalConnector
-
Number of edges using containing the connector
- incomingEdge(V) - Method in class graph.trees.dfs.DFSTree
-
Finds the incoming edge (starting from an ancestor of v (edge with lower index) and ending in v)
- incrementPertinentChildCount() - Method in class graph.tree.pq.PQTreeNode
-
Increases pertinent children count
- inDegree(V) - Method in class graph.elements.Graph
-
In degree of the given vertex
- inEdges(V) - Method in class graph.elements.Graph
-
All edges entering v
- InterlacementGraphEdge<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.interlacement
-
- InterlacementGraphEdge(InterlacementGraphVertex<V, E>, InterlacementGraphVertex<V, E>) - Constructor for class graph.algorithms.interlacement.InterlacementGraphEdge
-
- InterlacementGraphVertex<V extends Vertex,E extends Edge<V>> - Class in graph.algorithms.interlacement
-
Vertex of the interlacement graph.
- InterlacementGraphVertex(Path<V, E>) - Constructor for class graph.algorithms.interlacement.InterlacementGraphVertex
-
- intersectionOfLines(Line, Line) - Static method in class graph.math.Calc
-
Finds a point where the two given lines intersect
- inverse() - Method in class graph.symmetry.Permutation
-
Calculates inverse permutation
- isBalanced() - Method in class graph.tree.binary.BinaryTree
-
Checks if the binary tree is balanced
A height-balanced binary tree is defined as a binary tree in
which the depth of the two subtrees of every node
never differ by more than 1.
- isBeforeParent() - Method in class graph.math.Triangle
-
- isBiconnected() - Method in class graph.elements.Graph
-
Checks if a graph is biconnected.
- isBiconnected() - Method in class graph.properties.GraphProperties
-
Checks if the graph is biconnected
- isBipartite() - Method in class graph.properties.Bipartite
-
Determines whether an undirected graph is bipartite and finds either a
bipartition or an odd-length cycle.
- isCanBeConstructed() - Method in class graph.tree.binary.BinaryTree
-
- isConnected() - Method in class graph.elements.Graph
-
Checks is graph is connected
- isConnected(List<V>) - Method in class graph.elements.Graph
-
Checks is graph is connected presumed that certain vertices are removed
- isConnected() - Method in class graph.properties.GraphProperties
-
Checks is graph is connected
- isConnected(List<V>) - Method in class graph.properties.GraphProperties
-
Checks is graph is connected
- isCyclic() - Method in class graph.elements.Graph
-
Check if the graph is cyclic
- isCyclic() - Method in class graph.elements.Path
-
- isCyclic() - Method in class graph.properties.GraphProperties
-
Checks if the graph is cyclic
- isDehidralGroupGenerator(Permutation, Permutation) - Method in class graph.symmetry.PermutationAnalyzator
-
Checks if permutations form a dihedral group generator
- isDirected() - Method in class graph.elements.Graph
-
- isExternalFace(List<E>, List<E>) - Method in class graph.algorithms.drawing.VisibilityRepresentation
-
Checks if a list of edges (some cycle) is the external face
- isFinished() - Method in class graph.layout.util.PositionAction
-
- isHidden() - Method in enum graph.layout.PropertyEnums.BalloonProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.BoxProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.CircleProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.CompactTreeProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.FastOrganicProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.FruchtermanReingoldProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.HierarchicalProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.KamadaKawaiProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.NodeLinkTreeProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.OrganicProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.RadialTree2Properties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.RadialTreeProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.SpringProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.SymmetricProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.TreeProperties
-
- isHidden() - Method in enum graph.layout.PropertyEnums.TutteProperties
-
- isIdentityPermutation() - Method in class graph.symmetry.Permutation
-
Checks if the permutation is an identity permutation
- isOneGraph() - Method in class graph.layout.AbstractLayouter
-
- isPlannar(Graph<V, E>) - Method in class graph.algorithms.planarity.BoyerMyrvoldPlanarity
-
- isPlannar(Graph<V, E>) - Method in class graph.algorithms.planarity.FraysseixMendezPlanarity
-
- isPlannar(Graph<V, E>) - Method in class graph.algorithms.planarity.PlanarityTestingAlgorithm
-
Determines if the graph is planar
- isPlannar(Graph<V, E>) - Method in class graph.algorithms.planarity.PQTreePlanarity
-
- isPositionsEdges() - Method in class graph.layout.AbstractLayouter
-
- isProperSubgraph(Graph<V, E>, Graph<V, E>) - Method in class graph.operations.GraphOperations
-
Determines is one graph is a proper subraph of another one
H is a proper subgraph of G, if V(H)!=V(G) || E(H)!=E(G)
- isReflectionGroupGenerator(Permutation) - Method in class graph.symmetry.PermutationAnalyzator
-
Checks if a permutation is reflection group generator
- isRing() - Method in class graph.elements.Graph
-
Check if the graph is a ring
- isRing() - Method in class graph.properties.GraphProperties
-
Checks if the graph is a ring
- isRotationalGroupGenerator(Permutation) - Method in class graph.symmetry.PermutationAnalyzator
-
Checks if a permutation is rotation group generator
- isSemiRegular() - Method in class graph.symmetry.PermutationGroup
-
Checks if the group is semi-regular
Group is semi-regular if no permutation which is not an identity
has fixed points
- isSimple() - Method in class graph.elements.Graph
-
Checks if graph is simple
- isSink(V) - Method in class graph.elements.Graph
-
Checks if vertex is a sink (vertex with no outgoing edges)
- isSource(V) - Method in class graph.elements.Graph
-
Checks if vertex is a source (vertex with no incoming edges)
- isSubgraph(Graph<V, E>, Graph<V, E>) - Method in class graph.operations.GraphOperations
-
Determines is one graph is a subgraph of another one
- isTree() - Method in class graph.elements.Graph
-
Check if the graph is a tree
- isTree() - Method in class graph.properties.GraphProperties
-
Checks if the graph is a tree
- isValid() - Method in class graph.algorithms.lrpartition.LRPartitionEdge
-
- isVirtualEdge(E) - Method in class graph.tree.spqr.Skeleton
-
Check of the edge is virtual