Uses of Class
org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Node
Packages that use BoyerMyrvoldPlanarityInspector.Node
-
Uses of BoyerMyrvoldPlanarityInspector.Node in org.jgrapht.alg.planar
Fields in org.jgrapht.alg.planar declared as BoyerMyrvoldPlanarityInspector.NodeModifier and TypeFieldDescription(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.MergeInfo.child
The virtual root of the child biconnected component(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.MergeInfo.childPrev
The previous node along the traversal of the child biconnected componentprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.current
The node this circulator will return next(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.SearchInfo.current
The current node of the dfs traversalprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.failedV
The node $v$, which has an unembedded back edge incident to it.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Node.initialComponentRoot
The component root the node is created in.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node[] BoyerMyrvoldPlanarityInspector.Node.outerFaceNeighbors
Two neighbors on the outer face of the biconnected component.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.MergeInfo.parent
The node current traversal descended from.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.MergeInfo.parentNext
The next node along the traversal of the parent biconnected componentprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.prev
The previous node along the traversal of the component boundary.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Edge.source
The source node of this edge.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Edge.target
The target of this edgeFields in org.jgrapht.alg.planar with type parameters of type BoyerMyrvoldPlanarityInspector.NodeModifier and TypeFieldDescriptionprivate List
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.componentRoots
List of the virtual biconnected component roots.private List
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.dfsTreeRoots
List of the dfs tree roots of thegraph
.(package private) DoublyLinkedList.ListNode
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.Node.listNode
Stores the list node from theseparatedDfsChildList
of the parent node this node is stored in.private List
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.nodes
List of the vertices of thegraph
in their internal representation.(package private) DoublyLinkedList
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.Node.pertinentRoots
The roots of the pertinent components during the processing of the node $v$.(package private) DoublyLinkedList
<BoyerMyrvoldPlanarityInspector<V, E>.Node> BoyerMyrvoldPlanarityInspector.Node.separatedDfsChildList
The list containing the dfs children of this node, which are in the different child biconnected component, i.e.Methods in org.jgrapht.alg.planar that return BoyerMyrvoldPlanarityInspector.NodeModifier and TypeMethodDescriptionprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.createNewNode
(Map<V, BoyerMyrvoldPlanarityInspector<V, E>.Node> vertexMap, V graphVertex, E edge, BoyerMyrvoldPlanarityInspector<V, E>.Node parent, int dfsIndex) Creates a new node by converting thegraphVertex
to the internal node representation.private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.getComponentRoot
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns a component root of component thenode
is contained in.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.getCurrent()
Returns the node this circulator has just traversedprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.getNextOnPath
(BoyerMyrvoldPlanarityInspector<V, E>.Node w, BoyerMyrvoldPlanarityInspector<V, E>.Edge backEdge) Effectively is a method for finding nodez
in the notations of the original paper.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Edge.getOpposite
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns the opposite node of thenode
(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Node.getParent()
Returns the parent of this node in the dfs tree.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.getPrev()
Returns a node adjacent to the current node along the boundary, which is not equal to the next node along the traversal.private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.highest
(BoyerMyrvoldPlanarityInspector<V, E>.Node a, BoyerMyrvoldPlanarityInspector<V, E>.Node b) Returns the highest of the two input node, i.e.private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.lowest
(BoyerMyrvoldPlanarityInspector<V, E>.Node a, BoyerMyrvoldPlanarityInspector<V, E>.Node b) Returns the lowest of the two input node, i.e.BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.next()
(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Node.nextOnOuterFace
(BoyerMyrvoldPlanarityInspector<V, E>.Node prev) Returns a neighbor of this node which is not equal to theprev
private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.toExistingNode
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns eithernode
or its real counterpart in the case thenode
is a component root.Methods in org.jgrapht.alg.planar with parameters of type BoyerMyrvoldPlanarityInspector.NodeModifier and TypeMethodDescriptionprivate void
BoyerMyrvoldPlanarityInspector.addBoundaryEdges
(Set<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges, BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot) Adds the edges on the outer face of the component rooted atcomponentRoot
to the setedges
private void
BoyerMyrvoldPlanarityInspector.addPathEdges
(Set<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges, BoyerMyrvoldPlanarityInspector<V, E>.Edge startEdge, BoyerMyrvoldPlanarityInspector<V, E>.Node stop) Adds the edges on the path from thestartEdge
up to the nodestop
to the setedges
private void
BoyerMyrvoldPlanarityInspector.addPathEdges
(Set<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges, BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node stop) Adds the edges between thestart
and theend
to the setedges
private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.checkComponentForFailedEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot, BoyerMyrvoldPlanarityInspector<V, E>.Node v) Checks whether the biconnected component rooted atcomponentRoot
can be used to extract a Kuratowski subdivision.(package private) void
BoyerMyrvoldPlanarityInspector.Node.checkIsAdjacent
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Checks whether this node has a neighbornode
on the boundary of the biconnected componentprivate void
BoyerMyrvoldPlanarityInspector.cleanUpDfs
(BoyerMyrvoldPlanarityInspector<V, E>.Node dfsTreeRoot) Recursively cleans up the dfs tree rooted at thedfsTreeRoot
my removing all the short-circuit edges and properly orienting other embedded edgesprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.createNewNode
(Map<V, BoyerMyrvoldPlanarityInspector<V, E>.Node> vertexMap, V graphVertex, E edge, BoyerMyrvoldPlanarityInspector<V, E>.Node parent, int dfsIndex) Creates a new node by converting thegraphVertex
to the internal node representation.BoyerMyrvoldPlanarityInspector.embedBackEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node root, int entryDir, BoyerMyrvoldPlanarityInspector<V, E>.Edge edge, BoyerMyrvoldPlanarityInspector<V, E>.Node childPrev) Embeds the back edgeedge
into the list of embedded edges of the source and the virtual target of the edge such that thechildPrev
belongs to the new inner face.(package private) void
BoyerMyrvoldPlanarityInspector.Node.embedBackEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Edge edge, BoyerMyrvoldPlanarityInspector<V, E>.Node prev) Addsedge
to the list of the embedded edges such that theprev
node becomes an inner node.private void
BoyerMyrvoldPlanarityInspector.embedShortCircuit
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot, int entryDir, BoyerMyrvoldPlanarityInspector<V, E>.OuterFaceCirculator circulator) Embeds a short-circuit edge from thecomponentRoot
to the current node of thecirculator
.private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.findFailedEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node v) Finds an unembedded back edge tov
, which can be used to extract the Kuratowski subdivision.private List
<BoyerMyrvoldPlanarityInspector<V, E>.Edge> BoyerMyrvoldPlanarityInspector.findHighestObstructingPath
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot, BoyerMyrvoldPlanarityInspector<V, E>.Node w) Finds the highest obstructing path in the component rooted atcomponentRoot
.private boolean
BoyerMyrvoldPlanarityInspector.findPathDfs
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Edge startPrev, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> canGo, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> isFinish, List<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges) Generically searches a path from thecurrent
node to the first node satisfying theisFinish
predicate consisting of all the nodes satisfying thecanGo
predicate.private List
<BoyerMyrvoldPlanarityInspector<V, E>.Edge> BoyerMyrvoldPlanarityInspector.findPathToV
(List<BoyerMyrvoldPlanarityInspector<V, E>.Edge> path, BoyerMyrvoldPlanarityInspector<V, E>.Node v) Finds a path from some intermediate nodes on the path represented by the listpath
to the nodev
.private boolean
BoyerMyrvoldPlanarityInspector.firstStrictlyHigher
(BoyerMyrvoldPlanarityInspector<V, E>.Node a, BoyerMyrvoldPlanarityInspector<V, E>.Node b, BoyerMyrvoldPlanarityInspector<V, E>.Node c) Checks whether the first nodea
is strictly higher than nodesb
andc
private void
BoyerMyrvoldPlanarityInspector.fixBoundaryOrder
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot) Orient the connections on the outer face of the component rooted atcomponentRoot
such that they are orderedBoyerMyrvoldPlanarityInspector.getActiveSuccessorOnOuterFace
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node v, int dir) Returns an active node on the outer face in the directiondir
starting from thestart
nodeprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.getComponentRoot
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns a component root of component thenode
is contained in.BoyerMyrvoldPlanarityInspector.getExternallyActiveSuccessorOnOuterFace
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node stop, BoyerMyrvoldPlanarityInspector<V, E>.Node v, int dir) Returns acirculator to the externally active node on the outer face between thestart
andend
nodes in the directiondir
.private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.getNextOnPath
(BoyerMyrvoldPlanarityInspector<V, E>.Node w, BoyerMyrvoldPlanarityInspector<V, E>.Edge backEdge) Effectively is a method for finding nodez
in the notations of the original paper.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Edge.getOpposite
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns the opposite node of thenode
(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.hasBackEdgeWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Checks whether this node has a back edge to thenode
.private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.highest
(BoyerMyrvoldPlanarityInspector<V, E>.Node a, BoyerMyrvoldPlanarityInspector<V, E>.Node b) Returns the highest of the two input node, i.e.(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isActiveWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Check whether this node is active.(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isExternallyActiveWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Checks whether this node is externally active with respect to thenode
.(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isInactiveWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Check whether this node is inactive.(package private) boolean
BoyerMyrvoldPlanarityInspector.Edge.isIncidentTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) True if this edge is incident to the nodenode
, false otherwise(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isInternallyActiveWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Check whether this node is internally active.(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isPertinentWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Checks whether this node is pertinent in the context of processing the nodenode
.(package private) boolean
BoyerMyrvoldPlanarityInspector.Node.isVisitedWrtTo
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Checks whether this node is visited in the context of processing the nodenode
private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.lowest
(BoyerMyrvoldPlanarityInspector<V, E>.Node a, BoyerMyrvoldPlanarityInspector<V, E>.Node b) Returns the lowest of the two input node, i.e.(package private) void
BoyerMyrvoldPlanarityInspector.Node.mergeChildEdges
(DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges, int vIn, int vOut, BoyerMyrvoldPlanarityInspector<V, E>.Node parentNext, BoyerMyrvoldPlanarityInspector<V, E>.Edge parentEdge) Merges the embedded edges of the child component root into this node's embedded edges.(package private) BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.Node.nextOnOuterFace
(BoyerMyrvoldPlanarityInspector<V, E>.Node prev) Returns a neighbor of this node which is not equal to theprev
private void
BoyerMyrvoldPlanarityInspector.printBiconnectedComponent
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Method for debug purposes, prints the boundary thenode
belongs toprivate void
BoyerMyrvoldPlanarityInspector.removeUp
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node end, int dir, Set<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges) Removes the edges from the outer face from thestart
node to theend
node in the directiondir
from the setedges
private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.searchEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node current, int heightMax) Searches a back edge which target has a height smaller thanheightMax
private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.searchEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node current, int heightMax, BoyerMyrvoldPlanarityInspector<V, E>.Edge forbiddenEdge) Searches a back edge which target has a height smaller thanheightMax
private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.searchEdge
(BoyerMyrvoldPlanarityInspector<V, E>.Node current, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Edge> isNeeded) Generically searches an edge in the subtree rooted at thecurrent
, which doesn't include the children of thecurrent
that have beem merged to the parent biconnected component.private BoyerMyrvoldPlanarityInspector<V,
E>.Edge BoyerMyrvoldPlanarityInspector.searchSubtreeDfs
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Edge> isNeeded) Recursively searches all the subtree root at the nodestart
to find an edge satisfying thepredicate
.BoyerMyrvoldPlanarityInspector.selectOnOuterFace
(Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> predicate, BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node stop, int dir) Either finds and returns a circulator to the node on the boundary of the component, which satisfies thepredicate
or returns a circulator to thestop
node.private void
BoyerMyrvoldPlanarityInspector.setBoundaryDepth
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot, BoyerMyrvoldPlanarityInspector<V, E>.Node w, int dir, int delta) Iteratively sets a boundary height for the nodes on the outer face branch ending at the nodew
.(package private) void
BoyerMyrvoldPlanarityInspector.Node.substitute
(BoyerMyrvoldPlanarityInspector<V, E>.Node node, BoyerMyrvoldPlanarityInspector<V, E>.Node newNeighbor) Substitutes the neighbornode
with anewNeighbor
(package private) void
BoyerMyrvoldPlanarityInspector.Node.substituteAnother
(BoyerMyrvoldPlanarityInspector<V, E>.Node node, BoyerMyrvoldPlanarityInspector<V, E>.Node newNeighbor) Substitutes a neighbor of this node, which is not equal to thenode
, with thenewNeighbor
private BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.toExistingNode
(BoyerMyrvoldPlanarityInspector<V, E>.Node node) Returns eithernode
or its real counterpart in the case thenode
is a component root.private void
BoyerMyrvoldPlanarityInspector.walkDown
(BoyerMyrvoldPlanarityInspector<V, E>.Node componentRoot) The walkdown procedure from the original paper.private void
BoyerMyrvoldPlanarityInspector.walkUp
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node end, BoyerMyrvoldPlanarityInspector<V, E>.Edge edge) The walkup procedure from the original paper.Method parameters in org.jgrapht.alg.planar with type arguments of type BoyerMyrvoldPlanarityInspector.NodeModifier and TypeMethodDescriptionprivate BoyerMyrvoldPlanarityInspector<V,
E>.Node BoyerMyrvoldPlanarityInspector.createNewNode
(Map<V, BoyerMyrvoldPlanarityInspector<V, E>.Node> vertexMap, V graphVertex, E edge, BoyerMyrvoldPlanarityInspector<V, E>.Node parent, int dfsIndex) Creates a new node by converting thegraphVertex
to the internal node representation.private boolean
BoyerMyrvoldPlanarityInspector.findPathDfs
(BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Edge startPrev, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> canGo, Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> isFinish, List<BoyerMyrvoldPlanarityInspector<V, E>.Edge> edges) Generically searches a path from thecurrent
node to the first node satisfying theisFinish
predicate consisting of all the nodes satisfying thecanGo
predicate.private int
BoyerMyrvoldPlanarityInspector.orientDfs
(Map<V, BoyerMyrvoldPlanarityInspector<V, E>.Node> vertexMap, V startGraphVertex, int currentDfsIndex) Orients the input graph according to its dfs traversal by creating a dfs tree.BoyerMyrvoldPlanarityInspector.selectOnOuterFace
(Predicate<BoyerMyrvoldPlanarityInspector<V, E>.Node> predicate, BoyerMyrvoldPlanarityInspector<V, E>.Node start, BoyerMyrvoldPlanarityInspector<V, E>.Node stop, int dir) Either finds and returns a circulator to the node on the boundary of the component, which satisfies thepredicate
or returns a circulator to thestop
node.Constructors in org.jgrapht.alg.planar with parameters of type BoyerMyrvoldPlanarityInspector.NodeModifierConstructorDescription(package private)
Creates a new tree edge.(package private)
Edge
(E graphEdge, BoyerMyrvoldPlanarityInspector<V, E>.Node source, BoyerMyrvoldPlanarityInspector<V, E>.Node target) Creates a new edge.(package private)
Edge
(BoyerMyrvoldPlanarityInspector<V, E>.Node source, BoyerMyrvoldPlanarityInspector<V, E>.Node target) Creates a new short-circuit edge with no counterpart ingraph
.(package private)
MergeInfo
(BoyerMyrvoldPlanarityInspector<V, E>.Node parent, BoyerMyrvoldPlanarityInspector<V, E>.Node parentNext, BoyerMyrvoldPlanarityInspector<V, E>.Node child, BoyerMyrvoldPlanarityInspector<V, E>.Node childPrev, int vIn, int vOut) Creates new instance of the infromation needed to merge to biconnected components(package private)
Node
(V graphVertex, int dfsIndex, int height, BoyerMyrvoldPlanarityInspector<V, E>.Node initialComponentRoot, BoyerMyrvoldPlanarityInspector<V, E>.Edge parentEdge) Creates a new real node with the specified parameters.(package private)
OuterFaceCirculator
(BoyerMyrvoldPlanarityInspector<V, E>.Node current, BoyerMyrvoldPlanarityInspector<V, E>.Node prev) Creates a new instance of the circulator over the biconnected component boundary nodes.(package private)
SearchInfo
(BoyerMyrvoldPlanarityInspector<V, E>.Node current, BoyerMyrvoldPlanarityInspector<V, E>.Edge prevEdge, boolean backtrack) Creates a new search info