public static void TestDFS()
{
ListsGraph graph = SampleGraph();
Queue <SearchInfo> traversal = graph.DepthFirstSearch(0);
PrintTraversal("Depth First Search", traversal);
}
public static void TestRecursiveDFS()
{
ListsGraph graph = SampleGraph();
Queue <SearchInfo> traversal = new Queue <SearchInfo>();
SearchInfo[] searchInfo = graph.InitializeSearchInfo();
graph.RecursiveDFS(0, null, traversal, searchInfo);
PrintTraversal("Recursive Depth First Search", traversal);
}
private static ListsGraph SampleGraph()
{
ListsGraph graph = new ListsGraph(10);
graph.AddEdge(0, 1);
graph.AddEdge(0, 2);
graph.AddEdge(0, 3);
graph.AddEdge(1, 5);
graph.AddEdge(2, 4);
graph.AddEdge(3, 7);
graph.AddEdge(3, 8);
graph.AddEdge(4, 4);
graph.AddEdge(5, 6);
graph.AddEdge(7, 9);
return(graph);
}
