private void Visit(EdgeWeightedGraph graph, int v)
{
_marked[v] = true;
foreach (Edge edge in graph.Adj(v))
{
int w = edge.Other(v);
if (_marked[w])
{
continue;
}
if (edge.Weight < _distTo[w])
{
_edgeTo[w] = edge;
_distTo[w] = edge.Weight;
if (_pq.contains(w))
{
_pq.change(w, _distTo[w]);
}
else
{
_pq.insert(w, _distTo[w]);
}
}
}
}
private void visit(EdgeWeightedGraph G, int v)
{
mark[v] = true;
foreach (Edge e in G.adj(v))
{
int w = e.other(v);
if (mark[w])
{
continue;
}
if (e.getWeight() < distTo[w])
{
edgeTo[w] = e;
distTo[w] = e.getWeight();
if (pq.contains(w))
{
pq.change(w, distTo[w]);
}
else
{
pq.insert(w, distTo[w]);
}
}
}
}
