public static Dictionary <int, List <T> > DijkstraAlg <T>(T fromElement, T toElement, WeightedGraph <T> wGraph)
{
if (wGraph.SelectNodes(fromElement) == null)
{
throw new GraphException("FromElement not found");
}
if (wGraph.SelectNodes(toElement) == null)
{
throw new GraphException("ToElement not found");
}
Dictionary <T, int> CostNodes = new Dictionary <T, int>();
Dictionary <T, T> ParentNodes = new Dictionary <T, T>();
List <T> VerifiedNodes = new List <T>();
Dictionary <int, List <T> > FullPath = new Dictionary <int, List <T> >();
foreach (var Node in wGraph.SelectAll())
{
CostNodes.Add(Node, int.MaxValue);
ParentNodes.Add(Node, default);
}
CostNodes[fromElement] = 0;
foreach (var Node in wGraph.SelectNodes(fromElement))
{
CostNodes[Node.Value] = Node.Key;
ParentNodes[Node.Value] = fromElement;
}
T CurNode = findLowCostNode <T>(CostNodes, VerifiedNodes);
while (VerifiedNodes.Count < wGraph.GetCount())
{
if (CurNode != null)
{
int CurCost = CostNodes[CurNode];
var CurNeighbors = wGraph.SelectNodes(CurNode);
foreach (T CurNeighbor in CurNeighbors.Values)
{
int newCost = CurCost + CurNeighbors.SingleOrDefault(i => i.Value.Equals(CurNeighbor)).Key;
if (CostNodes[CurNeighbor] > newCost)
{
CostNodes[CurNeighbor] = newCost;
ParentNodes[CurNeighbor] = CurNode;
}
}
VerifiedNodes.Add(CurNode);
CurNode = findLowCostNode <T>(CostNodes, VerifiedNodes);
}
else
{
break;
}
}
FullPath.Add(CostNodes[toElement], new List <T>());
FullPath[CostNodes[toElement]].Add(toElement);
T CurParentNode = ParentNodes[toElement];
while (!CurParentNode.Equals(fromElement))
{
FullPath[CostNodes[toElement]].Add(CurParentNode);
CurParentNode = ParentNodes[CurParentNode];
}
FullPath[CostNodes[toElement]].Add(fromElement);
FullPath[CostNodes[toElement]].Reverse();
return(FullPath);
}
static void Main(string[] args)
{
try
{
Graph <String> graph = new Graph <string>();
Dictionary <String, List <String> > graphElements = new Dictionary <String, List <String> >();
graphElements["Me"] = new List <String>()
{
"Bob2", "Klare", "Alice"
};
graphElements["Bob2"] = new List <String>()
{
"Bob"
};
graphElements["Bob"] = new List <String>()
{
"Anudzh", "Paggy"
};
graphElements["Alice"] = new List <String>()
{
"Paggy"
};
graphElements["Klare"] = new List <String>()
{
"Tom", "John"
};
graphElements["Anudzh"] = new List <String>();
graphElements["Paggy"] = new List <String>();
graphElements["Tom"] = new List <String>();
graphElements["John"] = new List <String>();
foreach (var graphElement in graphElements)
{
graph.InsertElement(graphElement.Key);
}
foreach (var graphElement in graphElements)
{
if (graphElement.Value.Count > 0)
{
graph.InsertNodes(graphElement.Key, graphElement.Value);
}
}
foreach (var graphElement in graphElements)
{
List <String> Nodes = graph.SelectNodes(graphElement.Key);
Console.WriteLine($"For: {graphElement.Key}");
foreach (String RelationEelement in Nodes)
{
Console.WriteLine($"{RelationEelement};");
}
}
ShowShortestRoute <string>("Bob", "John", graph);
}
catch (GraphException e)
{
Console.WriteLine(e.ToString());
}
try
{
WeightedGraph <string> wGraph = new WeightedGraph <string>();
Dictionary <string, Dictionary <int, string> > wGraphElements = new Dictionary <string, Dictionary <int, string> >();
wGraphElements["TwinPicks"] = new Dictionary <int, string>()
{
{ 4, "TP_GG_0_0" }, { 10, "TP_GG_1_0" }
};
wGraphElements["TP_GG_0_0"] = new Dictionary <int, string>()
{
{ 21, "TP_GG_0_1" }
};
wGraphElements["TP_GG_1_0"] = new Dictionary <int, string>()
{
{ 5, "TP_GG_1_1" }, { 8, "TP_GG_1_2" }
};
wGraphElements["TP_GG_1_1"] = new Dictionary <int, string>()
{
{ 5, "TP_GG_0_1" }
};
wGraphElements["TP_GG_1_2"] = new Dictionary <int, string>()
{
{ 12, "TP_GG_0_1" }
};
wGraphElements["TP_GG_0_1"] = new Dictionary <int, string>()
{
{ 4, "GoldenGate" }
};
wGraphElements["GoldenGate"] = new Dictionary <int, string>();
foreach (var wGraphElement in wGraphElements)
{
wGraph.InsertElement(wGraphElement.Key);
}
foreach (var wGraphElement in wGraphElements)
{
if (wGraphElement.Value.Count > 0)
{
wGraph.InsertNodes(wGraphElement.Key, wGraphElement.Value);
}
}
foreach (var wGraphElement in wGraphElements)
{
Dictionary <int, string> Nodes = wGraph.SelectNodes(wGraphElement.Key);
Console.WriteLine($"For: {wGraphElement.Key}");
foreach (var RelationEelement in Nodes)
{
Console.WriteLine($"{wGraphElement.Key}---{RelationEelement.Key}min-->{RelationEelement.Value};");
}
}
ShowShortestRoute <string>("TwinPicks", "GoldenGate", wGraph);
}
catch (GraphException ge)
{
Console.WriteLine(ge.ToString());
}
finally
{
Console.WriteLine("OK");
}
Console.ReadKey();
}