Graph<int, string> graph = new Graph<int, string>();
graph.AddNode(1); // 添加節(jié)點(diǎn)1
graph.AddNode(2); // 添加節(jié)點(diǎn)2
graph.AddNode(3);
graph.AddNode(4);
graph.AddNode(5);
graph.Connect(1, 2, 4, "some custom information in edge"); // 添加節(jié)點(diǎn)1和2的邊長(zhǎng)（即成本）5，并添加描述信息
graph.Connect(2, 4, 1, "some custom information in edge"); 
graph.Connect(1, 4, 2, "some custom information in edge"); 
graph.Connect(2, 3, 4, "some custom information in edge"); 
graph.Connect(3, 4, 1, "some custom information in edge");
graph.Connect(3, 5, 3, "some custom information in edge"); 
graph.Connect(4, 5, 7, "some custom information in edge"); 
// graph.Connect(4, 3, 1, "some custom information in edge");  // 注釋這一句就會(huì)變成1 4 5 不注釋就是 1 4 3 5
// 證明這個(gè)算法只能算有向圖

ShortestPathResult result = graph.Dijkstra(1, 5); // 從圖中獲取節(jié)點(diǎn)1和2的最短路徑
IEnumerable<uint> path = result.GetPath();// 返回所需走過(guò)的節(jié)點(diǎn)列表
foreach (var item in path)
{
    System.Console.WriteLine(item);// 結(jié)果是 1 4 5 -> 因?yàn)?~3沒(méi)有距離
}