Exemple #1
0
        void Build()
        {
            if (data != null)
            {
                return;
            }

            EdgeArray <T> edgeArray = new EdgeArray <T>(graph);

            QuickSort <(int, int, T)> .Sort(edgeArray.Data, (a, b) => { return(a.Item3.CompareTo(b.Item3)); });

            NodeStack <(int, int, T)> spanningTree = new NodeStack <(int, int, T)>();
            UnionFind nodeRoot = new UnionFind(graph.NodesCount);

            for (int edge = 0; edge < edgeArray.Data.Length; ++edge)
            {
                (int from, int to, T edgeData) = edgeArray.Data[edge];
                if (!nodeRoot.HasOneRoot(from, to))
                {
                    spanningTree.Push((from, to, edgeData));
                    nodeRoot.Merge(from, to);
                    if (spanningTree.size == graph.NodesCount - 1)
                    {
                        break;
                    }
                }
            }

            data = new EdgeArray <T>(graph.NodesCount, Util.ListToArray <(int, int, T)>(spanningTree));
        }
        void Build()
        {
            if (data != null)
            {
                return;
            }

            NodeStack <(int, int, T)> spanningTree = new NodeStack <(int, int, T)>();

            EdgeArray <T> edgeArray = new EdgeArray <T>(graph);
            UnionFind     nodeRoot  = new UnionFind(graph.NodesCount);

            int[] nearestEdge = new int[graph.NodesCount];

            int selectedEdges = edgeArray.Data.Length;

            while (selectedEdges > 0)
            {
                Array.Fill(nearestEdge, -1);
                int newSelectedEdges = 0;
                for (int edge = 0; edge < selectedEdges; ++edge)
                {
                    (int from, int to, T edgeData) = edgeArray.Data[edge];
                    (int fromRoot, int toRoot)     = (nodeRoot.Find(from), nodeRoot.Find(to));

                    if (fromRoot == toRoot)
                    {
                        continue;
                    }
                    (edgeArray.Data[edge], edgeArray.Data[newSelectedEdges]) = (edgeArray.Data[newSelectedEdges], edgeArray.Data[edge]);

                    if (nearestEdge[fromRoot] == -1 || edgeData.CompareTo(edgeArray.Data[nearestEdge[fromRoot]].Item3) < 0)
                    {
                        nearestEdge[fromRoot] = newSelectedEdges;
                    }
                    if (nearestEdge[toRoot] == -1 || edgeData.CompareTo(edgeArray.Data[nearestEdge[toRoot]].Item3) < 0)
                    {
                        nearestEdge[toRoot] = newSelectedEdges;
                    }

                    ++newSelectedEdges;
                }
                selectedEdges = newSelectedEdges;
                for (int node = 0; node < graph.NodesCount; ++node)
                {
                    if (nearestEdge[node] != -1)
                    {
                        (int from, int to, T edgeData) = edgeArray.Data[nearestEdge[node]];
                        if (!nodeRoot.HasOneRoot(from, to))
                        {
                            spanningTree.Push((from, to, edgeData));
                            nodeRoot.Merge(from, to);
                        }
                    }
                }
            }

            data = new EdgeArray <T>(graph.NodesCount, Util.ListToArray <(int, int, T)>(spanningTree));
        }