static void Main(string[] args) { Graph g = new Graph(7); g.AddEdge(0, 1); g.AddEdge(0, 2); g.AddEdge(0, 3); g.AddEdge(1, 0); g.AddEdge(1, 5); g.AddEdge(2, 5); g.AddEdge(3, 0); g.AddEdge(3, 4); g.AddEdge(4, 6); g.AddEdge(5, 1); g.AddEdge(6, 5); Console.Write("Breadth First Traversal from vertex 5:\n"); g.BreadthFirstSearch(5); Console.Read(); }
static void Main(string[] args) { Graph g = new Graph(6, true); g.AddEdge(0, 1); g.AddEdge(0, 2); g.AddEdge(0, 3); g.AddEdge(1, 0); g.AddEdge(1, 5); g.AddEdge(2, 5); g.AddEdge(3, 0); g.AddEdge(3, 4); g.AddEdge(5, 1); Console.Write("Breadth First Traversal from vertex 2:\n"); //g.BreadthFirstSearch(2); foreach (var item in g.BreadthFirstSearch(2)) { Console.Write($"{ item } "); } Console.Read(); }