static void Main(string[] args)
{
/*
* BellmanFord bf1 = new BellmanFord(5);
* bf1.AddRoad(1, 2, 7);
* bf1.AddRoad(2, 4, 2);
* bf1.AddRoad(1, 3, 6);
* bf1.AddRoad(3, 4, 5);
* bf1.AddRoad(4, 5, 3);
* Console.WriteLine(bf1.Calculate(1, 5));
* // Console.WriteLine(bf1.ToString()); //1 2 5 1 3 1 2 4 3 3 2 2 4 3 4
*/
/*
* Dijkstra d = new Dijkstra(6);
* d.AddRoad(1, 2, 7);
* d.AddRoad(2, 4, 2);
* d.AddRoad(1, 3, 6);
* d.AddRoad(3, 4, 5);
* d.AddRoad(4, 5, 3);
* Console.WriteLine(d.Calculate(1, 5)); // 12
*/
/*
* FloydWarshall fw = new FloydWarshall(5);
* fw.AddRoad(1, 2, 7);
* fw.AddRoad(2, 4, 2);
* fw.AddRoad(1, 3, 6);
* fw.AddRoad(3, 4, 5);
* fw.AddRoad(4, 5, 3);
* // Console.WriteLine(fw.ToString()); //1 2 5 1 3 1 2 4 3 3 2 2 4 3 4
* Console.WriteLine(fw.Calculate(1, 5)); // 12
*/
ShortestPath sp = new ShortestPath(6);
sp.AddRoad(1, 2, 7);
sp.AddRoad(2, 4, 2);
sp.AddRoad(1, 3, 6);
sp.AddRoad(3, 4, 5);
sp.AddRoad(4, 5, 3);
List <int> result = sp.Calculate(1, 5);
}
static void Main(string[] args)
{
//Ex 1,2,3
ShortestPath s = new ShortestPath(5);
s.AddRoad(1, 2, 7);
s.AddRoad(2, 4, 2);
s.AddRoad(1, 3, 6);
s.AddRoad(3, 4, 5);
s.AddRoad(4, 5, 3);
//s.AddRoad(6, 7, 3); // -1
Console.WriteLine(s.Calculate(1, 5)); // 12
//Ex 4
/*ShortestPath s = new ShortestPath(5);
* s.AddRoad(1, 2, 7);
* s.AddRoad(2, 4, 2);
* s.AddRoad(1, 3, 6);
* s.AddRoad(3, 4, 5);
* s.AddRoad(4, 5, 3);
* s.Create(1, 5).ForEach(Console.Write); // 1245*/
}
