static void Main(string[] args)
{
Dictionary <Vertix <String>, List <Node <String> > > graph = new Dictionary <Vertix <String>, List <Node <String> > >();
Vertix <String> v1 = new Vertix <String>("A");
Vertix <String> v2 = new Vertix <String>("B");
Vertix <String> v3 = new Vertix <String>("C");
Vertix <String> v4 = new Vertix <String>("D");
Vertix <String> v5 = new Vertix <String>("E");
//adjacent nodes of v1
List <Node <String> > arr1 = new List <Node <String> >();
arr1.Add(new Node <String>(v2, 6));
//arr1.Add(new Node<String>(v3, 13));
arr1.Add(new Node <String>(v4, 1));
//arr1.Add(new Node<String>(v5, 20));
graph.Add(v1, arr1);
List <Node <String> > arr2 = new List <Node <String> >();
arr2.Add(new Node <String>(v1, 6));
arr2.Add(new Node <String>(v3, 5));
arr2.Add(new Node <String>(v4, 2));
arr2.Add(new Node <String>(v5, 2));
graph.Add(v2, arr2);
List <Node <String> > arr3 = new List <Node <String> >();
//arr3.Add(new Node<String>(v1, 13));
arr3.Add(new Node <String>(v2, 5));
//arr3.Add(new Node<String>(v4, 7));
arr3.Add(new Node <String>(v5, 5));
graph.Add(v3, arr3);
//
List <Node <String> > arr4 = new List <Node <String> >();
arr4.Add(new Node <String>(v1, 1));
arr4.Add(new Node <String>(v2, 2));
//arr4.Add(new Node<String>(v3, 7));
arr4.Add(new Node <String>(v5, 1));
graph.Add(v4, arr4);
List <Node <String> > arr5 = new List <Node <String> >();
//arr5.Add(new Node<String>(v1, 20));
arr5.Add(new Node <String>(v2, 2));
arr5.Add(new Node <String>(v3, 5));
arr5.Add(new Node <String>(v4, 1));
graph.Add(v5, arr5);
Graph <String> Graph = new Graph <String>(graph);
DijkstraAlgorithm <String> dijs = new DijkstraAlgorithm <String>(Graph, v1);
dijs.PrintShortestPath();
}
public bool JonhsonFATSPAlgorithm()
{
AuxiliaryGraph.AddNode(new Node(AuxiliaryGraph.QuantityOfNodes, "Temporary"));
for (int Index = 0; Index < AuxiliaryGraph.QuantityOfNodes - 1; Index++)
{
AuxiliaryGraph.AddTwoWayEdge(new Edge(0, AuxiliaryGraph.SetOfNodes[AuxiliaryGraph.QuantityOfNodes - 1], AuxiliaryGraph.SetOfNodes[Index]));
}
BellmanFordPathSearch = new BellmanFordAlgorithm(AuxiliaryGraph);
if (BellmanFordPathSearch.BellmanFordShortestPathSearchAlgorithm(AuxiliaryGraph.SetOfNodes[AuxiliaryGraph.QuantityOfNodes - 1]))
{
for (int FirstIndex = 0; FirstIndex < InnerGraph.QuantityOfNodes; FirstIndex++)
{
DijkstraPathSearch = new DijkstraAlgorithm(InnerGraph);
DijkstraPathSearch.DijkstraSWSAlgorithm(InnerGraph.SetOfNodes[FirstIndex]);
for (int SecondIndex = 0; SecondIndex < InnerGraph.QuantityOfNodes; SecondIndex++)
{
MatrixOfTheShortesPathes[FirstIndex, SecondIndex] = DijkstraPathSearch.ShortestPath[SecondIndex].Weight;
}
}
return(true);
}
else
{
for (int Index = 0; Index < InnerGraph.QuantityOfEdges; Index++)
{
InnerGraph.SetOfEdges[Index].Weight =
InnerGraph.SetOfEdges[Index].Weight +
BellmanFordPathSearch.ShortestPath[InnerGraph.SetOfEdges[Index][0].Index].Weight -
BellmanFordPathSearch.ShortestPath[InnerGraph.SetOfEdges[Index][1].Index].Weight;
}
for (int FirstIndex = 0; FirstIndex < InnerGraph.QuantityOfNodes; FirstIndex++)
{
DijkstraPathSearch = new DijkstraAlgorithm(InnerGraph);
DijkstraPathSearch.DijkstraSWSAlgorithm(InnerGraph.SetOfNodes[FirstIndex]);
for (int SecondIndex = 0; SecondIndex < InnerGraph.QuantityOfNodes; SecondIndex++)
{
MatrixOfTheShortesPathes[FirstIndex, SecondIndex] = DijkstraPathSearch.ShortestPath[SecondIndex].Weight;
}
}
}
return(true);
}
