数据结构之图应用最小生成树

//最小生成树的算法
    public void mst()
    {
        //从0开始
        vertexs[0].wasVisited = true;
        //把这个点压入栈中
        myStack.push(0);
        while(!myStack.isEmpty())
        {
            int v1 = myStack.peek();
            int v = getAdjUnvisitedVertex(v1);
            if(v == -1)
            {
                myStack.pop();
            }else{
                vertexs[v].wasVisited = true;
                myStack.push(v);
                displayVertex(v1);
                displayVertex(v);
                System.out.print(" ");
            }
        }
        
        //如果栈已经为空就结束
        for(int i = 0;i<currentVertexs;i++)
        {
            vertexs[i].wasVisited = false;
        }
        
        
    }