Uses of Class
org.graph4j.traversal.SearchNode

Packages that use SearchNode

Package	Description
org.graph4j.traversal	Implementations of the depth-first search (DFS) and breadth-first search (BFS) algorithms, using both iterator and visitor patterns.

Uses of SearchNode in org.graph4j.traversal

Methods in org.graph4j.traversal that return SearchNode

Modifier and Type	Method	Description
static SearchNode	SearchNode.nearestAncestor(SearchNode a, SearchNode b)
SearchNode	BFSIterator.next()
SearchNode	DFSIterator.next()
SearchNode	LexBFSIterator.next()
SearchNode	SearchNode.parent()

Methods in org.graph4j.traversal with parameters of type SearchNode

Modifier and Type	Method	Description
default void	BFSVisitor.backEdge(SearchNode from, SearchNode to)	A back edge vu is such that u is the ancestor of v, but vu is not a tree edge.
default void	DFSVisitor.backEdge(SearchNode from, SearchNode to)	A back edge vu is such that u is the ancestor of v, but vu is not a tree edge.
default void	BFSVisitor.crossEdge(SearchNode from, SearchNode to)	A cross edge connects two nodes such that they do not have any relationship between them (ancestor or descendant).
default void	DFSVisitor.crossEdge(SearchNode from, SearchNode to)	A cross edge connects two nodes such that they do not have any relationship between them (ancestor or descendant).
default void	BFSVisitor.finishVertex(SearchNode node, boolean leaf)	Invoked after all the neighbors of the current vertex have been visited (added to the queue).
default void	DFSVisitor.finishVertex(SearchNode node)	Invoked when leaving the subtree rooted in the current node, on the way up in the DFS tree, before upward.
default void	DFSVisitor.forwardEdge(SearchNode from, SearchNode to)	A forward edge vu is such that u is a descendant of v, but vu is not a tree edge.
boolean	SearchNode.isAncestorOf(SearchNode other)
default boolean	DFSVisitor.isRoot(SearchNode node)
static SearchNode	SearchNode.nearestAncestor(SearchNode a, SearchNode b)
default void	BFSVisitor.startVertex(SearchNode node)	Invoked whenever a vertex is reached for the first time as root or after a tree edge.
default void	DFSVisitor.startVertex(SearchNode node)	Invoked whenever a vertex is reached for the first time as root or after a tree edge.
default void	BFSVisitor.treeEdge(SearchNode from, SearchNode to)	A tree edge is part of the BFS tree obtained after the BFS traversal.
default void	DFSVisitor.treeEdge(SearchNode from, SearchNode to)	A tree edge is part of the DFS tree obtained after the DFS traversal.
default void	DFSVisitor.upward(SearchNode from, SearchNode to)	Invoked when the traversal algorithm moves up in the DFS tree.