Invoked on a vertex as it is removed from the priority queue and
added to set S. At this point we know that (p[u],u) is a
shortest-paths tree edge so
d[u] = delta(s,u) = d[p[u]] + w(p[u],u).
Also, the distances of the examined vertices is monotonically
increasing d[u1] <= d[u2] <= d[un].
Namespace:
QuickGraph.Algorithms.ShortestPathAssembly: QuickGraph.Algorithms (in QuickGraph.Algorithms.dll) Version: 2.4.2.1502 (2.4.2.1502)
Syntax
| C# |
|---|
public event VertexEventHandler ExamineVertex |
| Visual Basic (Declaration) |
|---|
Public Event ExamineVertex As VertexEventHandler |
