Esempio n. 1
0
        public static List <Tuple <int, int> > BFSwithTier(int startVertex, AdjacencyMatrixGraph g)
        {
            List <Tuple <int, int> > path = new List <Tuple <int, int> >();

            bool[] visited = new bool[g.GetCountVertexes()];
            Queue <Tuple <int, int> > q = new Queue <Tuple <int, int> >();

            q.Enqueue(Tuple.Create(startVertex, 0));
            visited[startVertex] = true;
            path.Add(Tuple.Create(startVertex, 0));

            while (q.Count != 0)
            {
                Tuple <int, int> pair = q.Dequeue();
                int node = pair.Item1;
                int tier = pair.Item2;
                foreach (var child in g.GetNeighbors(node))
                {
                    if (!visited[child])
                    {
                        q.Enqueue(Tuple.Create(child, tier + 1));
                        visited[child] = true;
                        path.Add(Tuple.Create(child, tier + 1));
                    }
                }
            }

            return(path);
        }
Esempio n. 2
0
        public static List <int> DFS(int startVertex, AdjacencyMatrixGraph g)
        {
            List <int> path = new List <int>();

            bool[]      visited = new bool[g.GetCountVertexes()];
            Stack <int> s       = new Stack <int>();

            s.Push(startVertex);
            visited[startVertex] = true;
            path.Add(startVertex);

            while (s.Count != 0)
            {
                int  node = s.Peek();
                bool flag = true;
                foreach (var child in g.GetNeighbors(node))
                {
                    if (!visited[child])
                    {
                        s.Push(child);
                        visited[child] = true;
                        path.Add(child);
                        flag = false;
                        break;
                    }
                }
                if (flag)
                {
                    s.Pop();
                }
            }

            return(path);
        }
Esempio n. 3
0
        public static List <int> BFS(int startVertex, AdjacencyMatrixGraph g)
        {
            List <int> path = new List <int>();

            bool[]      visited = new bool[g.GetCountVertexes()];
            Queue <int> q       = new Queue <int>();

            q.Enqueue(startVertex);
            visited[startVertex] = true;
            path.Add(startVertex);

            while (q.Count != 0)
            {
                int node = q.Dequeue();
                foreach (var child in g.GetNeighbors(node))
                {
                    if (!visited[child])
                    {
                        q.Enqueue(child);
                        visited[child] = true;
                        path.Add(child);
                    }
                }
            }

            return(path);
        }
Esempio n. 4
0
        static void Graph1()
        {
            AdjacencyMatrixGraph g = new AdjacencyMatrixGraph(6);

            g.AddEdge(0, 1); g.AddEdge(0, 2); g.AddEdge(1, 3);
            g.AddEdge(1, 4); g.AddEdge(4, 5); //g.AddEdge(2, 4);
            foreach (var pair in TraversalGraph.BFSwithTier(0, g))
            {
                Console.WriteLine("{0} - {1}", pair.Item1, pair.Item2);
            }
            Console.WriteLine();
            foreach (var node in TraversalGraph.DFS(0, g))
            {
                Console.WriteLine(node);
            }
        }
Esempio n. 5
0
        static void Graph3()
        {
            AdjacencyMatrixGraph g = new AdjacencyMatrixGraph(6);

            g.AddEdge(0, 5); g.AddEdge(1, 2); g.AddEdge(1, 4);
            g.AddEdge(1, 5); g.AddEdge(2, 4); g.AddEdge(2, 5);
            g.AddEdge(3, 4); g.AddEdge(4, 5);
            Console.WriteLine("Обход графа в ширину: ");
            Console.WriteLine();
            foreach (var pair in TraversalGraph.BFSwithTier(0, g))
            {
                Console.WriteLine("{0} - {1}", pair.Item1, pair.Item2);
            }
            Console.WriteLine();
            Console.WriteLine("Обход графа в глубину: ");
            Console.WriteLine();
            foreach (var node in TraversalGraph.DFS(0, g))
            {
                Console.WriteLine(node);
            }
        }