Package com.ibm.wala.util.graph.traverse
@NullMarked
package com.ibm.wala.util.graph.traverse
Graph traversal algorithms
-
ClassDescriptionBFSIterator<T>This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.This class searches breadth-first for node that matches some criteria.This class implements breadth-first search over a Graph, returning an Iterator of the nodes of the graph in order of discovery.utilities related to depth-first search.Extends
DFSPathFinderto discover all paths from a set of root nodes to nodes passing somePredicate.This class implements depth-first search over aNumberedGraph, return an enumeration of the nodes of the graph in order of increasing discover time.This class implements depth-first search over aGraph, return an enumeration of the nodes of the graph in order of increasing finishing time.This class searches depth-first search for node that matches some criteria.Floyd-Warshall algorithm to compute all-pairs shortest path in graph with no negative cycles.This class implements depth-first search over a NumberedGraph, return an enumeration of the nodes of the graph in order of increasing discover time.This class implements depth-first search over a NumberedGraph, return an enumeration of the nodes of the graph in order of increasing discover time.SCCIterator<T>This class computes strongly connected components for a Graph (or a subset of it).This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing discover time.This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing finishing time.Utilities for iterating over graphs in topological order.WelshPowell<T>