Traversal

Usage

use Traversal;

iter vertexBFS(graph, v: graph._value.vDescType, s = 1): graph._value.vDescType

Requires implementation of termination detection first. Need to have a generic visitor pattern using both a breadth first and depth first search. After this is done, can implement the components code.

iter vertexBFS(graph, v: graph._value.vDescType, s = 1, param tag: iterKind): graph._value.vDescType

iter edgeBFS(graph, e: graph._value.eDescType, s = 1, useMaximumParallelism = false): graph._value.eDescType

iter edgeBFS(graph, e: graph._value.eDescType, s = 1, useMaximumParallelism = false, param tag: iterKind): graph._value.eDescType