.. default-domain:: chpl

.. module:: Traversal

Traversal
=========
**Usage**

.. code-block:: chapel

   use Traversal;

.. iterfunction:: 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.

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

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

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