Uses of Class
org.jgrapht.alg.planar.BoyerMyrvoldPlanarityInspector.Edge

Packages that use BoyerMyrvoldPlanarityInspector.Edge

Package	Description
org.jgrapht.alg.planar	Algorithms for testing planarity of the graphs

Uses of BoyerMyrvoldPlanarityInspector.Edge in org.jgrapht.alg.planar

Fields in org.jgrapht.alg.planar declared as BoyerMyrvoldPlanarityInspector.Edge

Modifier and Type	Field	Description
(package private) BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.Node.edgeToEmbed	If this node has a back edge incident to the currently processed node $v$, then this variable stores this edge
(package private) BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.Node.parentEdge	Edge to the parent node of this node in the dfs tree.
(package private) BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.SearchInfo.prevEdge	The edge used to go to the current vertex

Fields in org.jgrapht.alg.planar with type parameters of type BoyerMyrvoldPlanarityInspector.Edge

Modifier and Type	Field	Description
(package private) List<BoyerMyrvoldPlanarityInspector<V,E>.Edge>	BoyerMyrvoldPlanarityInspector.Node.backEdges	The list of back edges incident to this node.
(package private) List<BoyerMyrvoldPlanarityInspector<V,E>.Edge>	BoyerMyrvoldPlanarityInspector.Node.downEdges	The list containing the edges from descendants of this node in the dfs tree.
(package private) DoublyLinkedList<BoyerMyrvoldPlanarityInspector<V,E>.Edge>	BoyerMyrvoldPlanarityInspector.Node.embedded	The list of the embedded edges incident to this node in a clockwise or a counterclockwise order.
(package private) List<BoyerMyrvoldPlanarityInspector<V,E>.Edge>	BoyerMyrvoldPlanarityInspector.Node.treeEdges	The list of tree edges incident to this node in the dfs tree.

Methods in org.jgrapht.alg.planar that return BoyerMyrvoldPlanarityInspector.Edge

Modifier and Type	Method	Description
private BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.checkComponentForFailedEdge(BoyerMyrvoldPlanarityInspector<V,E>.Node componentRoot, BoyerMyrvoldPlanarityInspector<V,E>.Node v)	Checks whether the biconnected component rooted at componentRoot can be used to extract a Kuratowski subdivision.
(package private) BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.OuterFaceCirculator.edgeToNext()	Returns an edge connecting previously returned node with node, which will be returned next.
private BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.findFailedEdge(BoyerMyrvoldPlanarityInspector<V,E>.Node v)	Finds an unembedded back edge to v, which can be used to extract the Kuratowski subdivision.
private BoyerMyrvoldPlanarityInspector<V,E>.Edge	BoyerMyrvoldPlanarityInspector.searchEdge(BoyerMyrvoldPlanarityInspector<V,E>.Node current, int heightMax)	Searches a back edge which target has a height smaller than heightMax
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 than heightMax
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 the current, which doesn't include the children of the current 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 node start to find an edge satisfying the predicate.

Methods in org.jgrapht.alg.planar that return types with arguments of type BoyerMyrvoldPlanarityInspector.Edge

Modifier and Type	Method	Description
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 at componentRoot.
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 list path to the node v.

Methods in org.jgrapht.alg.planar with parameters of type BoyerMyrvoldPlanarityInspector.Edge

Modifier and Type	Method	Description
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 the startEdge up to the node stop to the set edges
private BoyerMyrvoldPlanarityInspector<V,E>.OuterFaceCirculator	BoyerMyrvoldPlanarityInspector.embedBackEdge(BoyerMyrvoldPlanarityInspector<V,E>.Node root, int entryDir, BoyerMyrvoldPlanarityInspector<V,E>.Edge edge, BoyerMyrvoldPlanarityInspector<V,E>.Node childPrev)	Embeds the back edge edge into the list of embedded edges of the source and the virtual target of the edge such that the childPrev belongs to the new inner face.
(package private) void	BoyerMyrvoldPlanarityInspector.Node.embedBackEdge(BoyerMyrvoldPlanarityInspector<V,E>.Edge edge, BoyerMyrvoldPlanarityInspector<V,E>.Node prev)	Adds edge to the list of the embedded edges such that the prev node becomes an inner node.
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 the current node to the first node satisfying the isFinish predicate consisting of all the nodes satisfying the canGo predicate.
private BoyerMyrvoldPlanarityInspector<V,E>.Node	BoyerMyrvoldPlanarityInspector.getNextOnPath(BoyerMyrvoldPlanarityInspector<V,E>.Node w, BoyerMyrvoldPlanarityInspector<V,E>.Edge backEdge)	Effectively is a method for finding node z in the notations of the original paper.
(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.
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 than heightMax
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.Edge

Modifier and Type	Method	Description
private 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 at componentRoot to the set edges
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 the startEdge up to the node stop to the set edges
private void	BoyerMyrvoldPlanarityInspector.addPathEdges(Set<BoyerMyrvoldPlanarityInspector<V,E>.Edge> edges, BoyerMyrvoldPlanarityInspector<V,E>.Node start, BoyerMyrvoldPlanarityInspector<V,E>.Node stop)	Adds the edges between the start and the end to the set edges
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 the current node to the first node satisfying the isFinish predicate consisting of all the nodes satisfying the canGo 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 list path to the node v.
private Graph<V,E>	BoyerMyrvoldPlanarityInspector.finish(Set<BoyerMyrvoldPlanarityInspector<V,E>.Edge> subdivision)	Finishes the Kuratowski subdivision extraction by constructing the desired subgraph
(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.
private 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 the start node to the end node in the direction dir from the set edges
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 the current, which doesn't include the children of the current 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 node start to find an edge satisfying the predicate.

Constructors in org.jgrapht.alg.planar with parameters of type BoyerMyrvoldPlanarityInspector.Edge

Modifier	Constructor	Description
(package private)	Node(int dfsIndex, BoyerMyrvoldPlanarityInspector<V,E>.Edge parentEdge)	Creates a new component root.
(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)	Node(V graphVertex, int dfsIndex, BoyerMyrvoldPlanarityInspector<V,E>.Edge parentEdge, boolean rootVertex)	Creates a new node with the specified parameters
(package private)	SearchInfo(BoyerMyrvoldPlanarityInspector<V,E>.Node current, BoyerMyrvoldPlanarityInspector<V,E>.Edge prevEdge, boolean backtrack)	Creates a new search info