Uses of Class
org.graph4j.traversal.SearchNode
Packages that use SearchNode
Package
Description
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 SearchNodeModifier and TypeMethodDescriptionstatic SearchNodeSearchNode.nearestAncestor(SearchNode a, SearchNode b) BFSIterator.next()DFSIterator.next()LexBFSIterator.next()SearchNode.parent()Methods in org.graph4j.traversal with parameters of type SearchNodeModifier and TypeMethodDescriptiondefault voidBFSVisitor.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 voidDFSVisitor.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 voidBFSVisitor.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 voidDFSVisitor.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 voidBFSVisitor.finishVertex(SearchNode node, boolean leaf) Invoked after all the neighbors of the current vertex have been visited (added to the queue).default voidDFSVisitor.finishVertex(SearchNode node) Invoked when leaving the subtree rooted in the current node, on the way up in the DFS tree, before upward.default voidDFSVisitor.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.booleanSearchNode.isAncestorOf(SearchNode other) default booleanDFSVisitor.isRoot(SearchNode node) static SearchNodeSearchNode.nearestAncestor(SearchNode a, SearchNode b) default voidBFSVisitor.startVertex(SearchNode node) Invoked whenever a vertex is reached for the first time as root or after a tree edge.default voidDFSVisitor.startVertex(SearchNode node) Invoked whenever a vertex is reached for the first time as root or after a tree edge.default voidBFSVisitor.treeEdge(SearchNode from, SearchNode to) A tree edge is part of the BFS tree obtained after the BFS traversal.default voidDFSVisitor.treeEdge(SearchNode from, SearchNode to) A tree edge is part of the DFS tree obtained after the DFS traversal.default voidDFSVisitor.upward(SearchNode from, SearchNode to) Invoked when the traversal algorithm moves up in the DFS tree.