static void Main(string[] args)
{
WeightedGraph <string> graph = new WeightedGraph <string>();
Node <string> ivan = graph.AddNode("Ivan");
Node <string> georgi = graph.AddNode("Georgi");
Node <string> rosti = graph.AddNode("Rosti");
Node <string> niki = graph.AddNode("Niki");
Node <string> peter = graph.AddNode("Peter");
Node <string> vasil = graph.AddNode("Vasil");
graph.Connect(ivan, georgi, 4);
graph.Connect(georgi, peter, 2);
graph.Connect(niki, peter, 3);
graph.Connect(niki, rosti, 8);
graph.Connect(rosti, georgi, 1);
graph.Connect(rosti, ivan, 2);
graph.Connect(vasil, ivan, 1);
graph.Connect(vasil, georgi, 1);
Console.WriteLine();
int minLength = 4;
bool exists = graph.PathWithLengthExists(peter, vasil, minLength);
Console.WriteLine("Path with length at least " + minLength + " : " + (exists ? "exists" : "does not exist"));
Console.WriteLine();
}
static void Main(string[] args)
{
WeightedGraph <string> graph = new WeightedGraph <string>();
Node <string> ivan = graph.AddNode("Ivan");
Node <string> georgi = graph.AddNode("Georgi");
Node <string> rosti = graph.AddNode("Rosti");
Node <string> niki = graph.AddNode("Niki");
Node <string> peter = graph.AddNode("Peter");
Node <string> vasil = graph.AddNode("Vasil");
graph.Connect(ivan, georgi, 4);
graph.Connect(georgi, peter, 2);
graph.Connect(niki, peter, 3);
graph.Connect(niki, rosti, 8);
graph.Connect(rosti, georgi, 1);
graph.Connect(rosti, ivan, 2);
graph.Connect(vasil, ivan, 1);
graph.Connect(vasil, georgi, 1);
Path <string> path = graph.GetShortestPath(ivan, niki);
Console.WriteLine("Pathfind test : ");
foreach (var node in path)
{
Console.Write("->" + node.Value);
}
Console.WriteLine();
Console.WriteLine("Length " + path.Length);
Console.WriteLine();
Path <string> shortestCycle = graph.FindShortestCycle(3);
Console.WriteLine("Shortest Cycle : ");
foreach (var node in shortestCycle)
{
Console.Write("->" + node.Value);
}
Console.WriteLine();
}