static public void initializeVariables(MazeGraph <T> G)
{
N = G.numVert();
g = new MazeGraph <T>(N, G.rows, G.cols);
added = new bool[N];
added[0] = true; //first node;
edge = new Edge <T>(0, 0, default(T));
queue = new PartialOrderedTree <Edge <T> >(N * ((N - 1) / 2) - N + 2);
}
static void initializeVariables(MazeGraph <T> G)
{
n = G.numVert();
g = new MazeGraph <T>(n, G.rows, G.cols);
P = new Partition(n);
queue = new PartialOrderedTree <Edge <T> >(n * n);
for (int i = 0; i < n; ++i)
{
List <MazeGraph <T> .VertexCost> adj = G.Adjacents(i);
for (int j = 0; j < adj.Count; ++j)
{
queue.insert(new Edge <T>(i, adj[j].vertex, adj[j].cost));
}
}
}
