private static void GermanCities()
{
Graph1 <string> germanCities = new Graph1 <string>();
germanCities.AddEdge("Frankfurt", "Mannheim", false);
germanCities.AddEdge("Frankfurt", "Wurzburg", false);
germanCities.AddEdge("Frankfurt", "Kassel", false);
germanCities.AddEdge("Mannheim", "Karlsruhe", false);
germanCities.AddEdge("Karlsruhe", "Augsburg", false);
germanCities.AddEdge("Augsburg", "Munchen", false);
germanCities.AddEdge("Wurzburg", "Erfurt", false);
germanCities.AddEdge("Wurzburg", "Nurnberg", false);
germanCities.AddEdge("Nurnberg", "Stuttgart", false);
germanCities.AddEdge("Nurnberg", "Munchen", false);
germanCities.AddEdge("Kassel", "Munchen", false);
Console.WriteLine("\n**** DFS Iterative *****");
germanCities.DFS("Frankfurt");
Console.WriteLine("--------------");
Console.WriteLine("\n**** DFS Recursive ****\n");
germanCities.DFS("Frankfurt", true);
Console.WriteLine("**************");
Console.WriteLine();
Console.WriteLine("**** BFS *****");
germanCities.BFS("Frankfurt");
Console.WriteLine("**************");
Console.WriteLine("~~~~~~~~~~~~~~~~~~~~~~~");
germanCities.FindSpanningTree();
Console.WriteLine("~~~~~~~~~~~~~~~~~~~~~~~");
germanCities.FindPathBetweenTwoVertices("Frankfurt", "Stuttgart");
Console.ReadLine();
}
private static void FindPathBetweenTwoNodes()
{
Graph1 <int> Graph = new Graph1 <int>();
Graph.AddEdge(1, 2, false);
Graph.AddEdge(2, 3, false);
Graph.AddEdge(3, 4, false);
Graph.AddEdge(1, 5, false);
Graph.AddEdge(5, 6, false);
Graph.AddEdge(6, 7, false);
Graph.AddEdge(5, 8, false);
Graph.AddEdge(1, 9, false);
Graph.AddEdge(9, 10, false);
Graph.FindPathBetweenTwoVertices(1, 7);
Console.ReadLine();
}