/// <summary>
/// Traverses a list of nodes. Internally handles the state of traversed/untraversed nodes.
/// </summary>
/// <param name="count"></param>
/// <param name="start"></param>
/// <param name="nodeAct"></param>
/// <param name="getAdjacents"></param>
public static void TraverseBreadthFirst(int count, int start, DistNodeAction nodeAct, GetAdjacents getAdjacents)
{
if (nodeAct == null)
{
throw new ArgumentNullException(nameof(nodeAct));
}
if (getAdjacents == null)
{
throw new ArgumentNullException(nameof(getAdjacents));
}
int[] found = new int[count];
for (int ii = 0; ii < found.Length; ii++)
{
found[ii] = -1;
}
Queue <int> toExplore = new Queue <int>();
toExplore.Enqueue(start);
found[start] = 0;
while (toExplore.Count > 0)
{
// take a node
int node = toExplore.Dequeue();
// act on node
nodeAct(node, found[node]);
// add adjacents to the END of queue
List <int> adjacents = getAdjacents(node);
for (int ii = 0; ii < adjacents.Count; ii++)
{
int adjacent = adjacents[ii];
if (found[adjacent] == -1)
{
toExplore.Enqueue(adjacent);
found[adjacent] = found[node] + 1;
}
}
}
}
/// <summary>
/// Traverses a list of nodes. Internally handles the state of traversed/untraversed nodes.
/// </summary>
/// <typeparam name="TID"></typeparam>
/// <param name="start"></param>
/// <param name="nodeAct"></param>
/// <param name="getAdjacents"></param>
public static void TraverseBreadthFirst <TID>(TID start, DistNodeAction <TID> nodeAct, GetAdjacents <TID> getAdjacents)
{
if (nodeAct == null)
{
throw new ArgumentNullException(nameof(nodeAct));
}
if (getAdjacents == null)
{
throw new ArgumentNullException(nameof(getAdjacents));
}
Dictionary <TID, int> found = new Dictionary <TID, int>();
Queue <TID> toExplore = new Queue <TID>();
toExplore.Enqueue(start);
found[start] = 0;
while (toExplore.Count > 0)
{
// take a node
TID node = toExplore.Dequeue();
// act on node
nodeAct(node, found[node]);
// add adjacents to the END of queue
List <TID> adjacents = getAdjacents(node);
for (int ii = 0; ii < adjacents.Count; ii++)
{
TID adjacent = adjacents[ii];
if (!found.ContainsKey(adjacent))
{
toExplore.Enqueue(adjacent);
found[adjacent] = found[node] + 1;
}
}
}
}
