Anonymous user
Dijkstra's algorithm: Difference between revisions
→{{header|D}}
Line 381:
=={{header|D}}==
This solution is incorrect. Since the path is directed and f is only a sink, f cannot be in the middle of a path.
{{trans|C++}}
The algorithm and the important data structures are essentially the same as in the C++ version, so the same comments apply (built-in D associative arrays are unsorted).
| |||