public static void calculate(Graph g, int r)
{
/* init vertices list. */
for (int i = 0; i < g.n_v; i++)
{
g.v[i].key = float.MaxValue;
// g.v[i].distance2D = float.MaxValue;
g.v[i].parent = -1;
}
/* Set root. */
g.v[r].key = 0;
/* Prepare queue of type min. */
//FibonacciHeap q = new FibonacciHeap(g);
NaiveProrityQueue q = new NaiveProrityQueue(g);
/* Until queue is empty. */
while (!q.isQueueEmpty())
{
FibonacciNode u = q.extractMin();
Console.Write("" + u.key);
g.v[u.index].inQ = false;
LinkedListNode tmp = g.adj.getVertex(u.index).root;
while (tmp != null)
{
if (g.v[tmp.index].inQ && g.wageFunction(u.index, tmp.index) < g.v[tmp.index].key)
{
g.v[tmp.index].parent = u.index;
q.decreaseKey(g.v[tmp.index], g.wageFunction(u.index, tmp.index), g.wage2D(u.index, tmp.index));
}
tmp = tmp.next;
}
}
}
public static void calculate(Graph g, int r)
{
/* init vertices list. */
for (int i = 0; i < g.n_v; i++)
{
g.v[i].key = float.MaxValue;
// g.v[i].distance2D = float.MaxValue;
g.v[i].parent = -1;
}
/* Set root. */
g.v[r].key = 0;
/* Prepare queue of type min. */
//FibonacciHeap q = new FibonacciHeap(g);
NaiveProrityQueue q = new NaiveProrityQueue(g);
/* Until queue is empty. */
while (!q.isQueueEmpty())
{
FibonacciNode u = q.extractMin();
Console.Write("" + u.key);
g.v[u.index].inQ = false;
LinkedListNode tmp = g.adj.getVertex(u.index).root;
while (tmp != null)
{
if (g.v[tmp.index].inQ && g.wageFunction(u.index, tmp.index) < g.v[tmp.index].key)
{
g.v[tmp.index].parent = u.index;
q.decreaseKey(g.v[tmp.index], g.wageFunction(u.index, tmp.index), g.wage2D(u.index, tmp.index));
}
tmp = tmp.next;
}
}
}
