Class DijikstraShortestPath<T, W>
A dijikstra algorithm implementation using Fibonacci Heap.
Inheritance
DijikstraShortestPath<T, W>
Assembly: Advanced.Algorithms.dll
Syntax
public class DijikstraShortestPath<T, W>
where W : IComparable
Type Parameters
Constructors
DijikstraShortestPath(IShortestPathOperators<W>)
Declaration
public DijikstraShortestPath(IShortestPathOperators<W> operator)
Parameters
Methods
FindShortestPath(IGraph<T>, T, T)
Get shortest distance to target.
Declaration
public ShortestPathResult<T, W> FindShortestPath(IGraph<T> graph, T source, T destination)
Parameters
| Type |
Name |
Description |
| IGraph<T> |
graph |
|
| T |
source |
|
| T |
destination |
|
Returns