using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

using System.Threading.Tasks;

class Program

    {

        class GraphMatrix

        {

            private int[,] vertices;

            public GraphMatrix(int[,] Vertices)

            {

                this.vertices = Vertices;

            }

            public void  AddEdge(int i, int y, int weight)

            {

                vertices[i, y] = weight;

            }

            public void AddEdge(int i, int y)

            {

                vertices[i, y] = 1;

            }

            public void RemoveEdge(int i, int y)

            {

                vertices[i, y] = 0;

            }

            public bool HasEdge(int i, int y)

            {

                return vertices[i, y] != 0;

​

            }

            public IList<int> Succesors(int i)

            {

                IList<int> succesors = new List<int>();

                for (int j = 0; j < vertices.GetLength(1); j++)

                {

                    if (vertices[i, j] != 0)

                    {

                        succesors.Add(j);

                    }

                }

                return succesors;

            }

            public void PrintBFS(int startV)

            {

                if (startV >= vertices.GetLength(0))

                {

                    throw new ArgumentException("start node is wrong");

                }

                List<int> visited = new List<int>();

                Queue<int> queue = new Queue<int>();

                visited.Add(startV);

                queue.Enqueue(startV);

                while (queue.Count != 0)

                {

                    int current = queue.Dequeue();

                    Console.WriteLine(current);

                    foreach (int n in this.Succesors(current))

                    {

                        if (!visited.Contains(n))

                        {

                            queue.Enqueue(n);

                            visited.Add(n);

                        }

​

                    }

                }

            }

            public void PrintDFS(int startV)

            {

                if (startV >= vertices.GetLength(0))

                {

                    throw new ArgumentException("start node is wrong");

                }

                List<int> visite = new List<int>();

                Stack<int> stack = new Stack<int>();

                visite.Add(startV);

                stack.Push(startV);

                while (stack.Count != 0)

                {

                    int current = stack.Pop();

                    Console.WriteLine(current);

                    foreach (int n in this.Succesors(current))

                    {

                        if (!visite.Contains(n))

                        {

                            stack.Push(n);

                            visite.Add(n);

                        }

​

                    }

                }

            }

​

        }

        static void Main(string[] args)

        {

            Console.Write("Enter node to start: ");

            int start = int.Parse(Console.ReadLine());

​

            int[,] graph = new int[,] { { 0, 1, 1, 1, 1 },

                                      { 1, 0, 0, 0, 1 },

                                      { 1, 0, 0, 1, 1 },

                                      { 1, 0, 1, 0, 0 },

                                      { 1, 1, 1, 0, 0 } };

​

            GraphMatrix gm = new GraphMatrix(graph);

​

            try

            {

                Console.Write($"BFS from node {start}: ");

                gm.PrintBFS(start);

                Console.WriteLine();

                Console.Write($"DFS drom node {start}: ");

                gm.PrintDFS(start);

            }

            catch (ArgumentException e)

            {

                Console.WriteLine(e.Message);

            }

        }

    }