Package org.graph4j.traversal

package org.graph4j.traversal
Implementations of the depth-first search (DFS) and breadth-first search (BFS) algorithms, using both iterator and visitor patterns.
  • Class
    Description
    BFSIterator
    A breadth first search (BFS) iterator over the vertices of the graph.
    BFSTraverser
    A breadth first search (BFS) traverser of the graph.
    BFSVisitor
    A breadth first search (BFS) visitor of a graph.
    DFSIterator
    A depth first search (DFS) iterator over the vertices of the graph.
    DFSTraverser
    A depth first search (DFS) traverser of the graph.
    DFSVisitor
    A depth first search (DFS) visitor of a graph.
    InterruptedVisitorException
     
    LexBFSIterator
    A Lexicographic Breadth-First Search (Lex-BFS) is an algorithm for ordering the vertices of a graph.
    LexBFSIteratorInt
    Deprecated.
    MaximumCardinalityIterator
    Implements an iterator that performs Maximum Cardinality Search (MCS) algorithm on an undirected graph.
    SearchNode
    A node of the BFS or DFS tree created while traversing a graph.
    TopologicalOrderIterator
    A topological order iterator for a directed acyclic graph (DAG).