/graph/main/traverse/index.ts | rimbu@1.0.0

import * as rimbu from "https://deno.land/x/rimbu@1.0.0/graph/main/traverse/index.ts";

Functions

f traverseBreadthFirstCustom	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using breadth-first traversal. It can avoid loops if needed in a custom way by supplying the `addVisitedNode` function.
f traverseBreadthFirstHashed	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using breadth-first traversal. It avoids loops by internally placing the visited nodes in a HashSet builder.
f traverseBreadthFirstSorted	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using breadth-first traversal. It avoids loops by internally placing the visited nodes in a SortedSet builder.
f traverseDepthFirstCustom	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using depth-first traversal. It can avoid loops if needed in a custom way by supplying the `addVisitedNode` function.
f traverseDepthFirstHashed	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using depth-first traversal. It avoids loops by internally placing the visited nodes in a HashSet builder.
f traverseDepthFirstSorted	Returns a stream of connections that can be reached in the given `graph` starting at the given `startNode`, and using depth-first traversal. It avoids loops by internally placing the visited nodes in a SortedSet builder.

Type Aliases

LinkType

Utility type to determine if a graph has valued or unvalued links