public SP(EdgeWeightedDigraph G, int s)
{
_G = G;
_s = s;
_distTo = new double[G.V()];
_edgeTo = new DirectedEdge[G.V()];
}
public DijkstraSP(EdgeWeightedDigraph G, int s) : base(G, s)
{
_pq = new IndexMinPQ <double>(G.E());
for (int i = 0; i < G.V(); i++)
{
_distTo[i] = double.PositiveInfinity;
}
_distTo[s] = 0d;
_pq.Insert(0, 0d);
while (!_pq.IsEmpty())
{
var w = _pq.RemoveMin();
Relax(G, w);
}
}
public void RunSp()
{
EdgeWeightedDigraph G = new EdgeWeightedDigraph("tinyEWD.txt");
int s = 0;
SP sp = Factory.GetSp(G, s);
for (int t = 0; t < G.V(); t++)
{
Console.Write(s + " to " + t);
Console.Write(" ({0:F2}): ", sp.DistTo(t));
if (sp.HasPathTo(t))
{
foreach (DirectedEdge e in sp.PathTo(t))
{
Console.Write(e + " ");
}
}
Console.WriteLine();
}
}
