private static void P6EdmondsKarp()
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P5Fluesse;
var hGraph = AdjacentListGraphImporter.ImportAdjacentList <CapacityWeighted>(hFileName, EdgeKind.DirectedWeighted);
var hEdmondsKarpAlgorithm = new EdmondsKarpAlgorithm(hGraph);
hEdmondsKarpAlgorithm.Execute(0, 7);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P5Fluesse2;
hGraph = AdjacentListGraphImporter.ImportAdjacentList <CapacityWeighted>(hFileName, EdgeKind.DirectedWeighted);
hEdmondsKarpAlgorithm = new EdmondsKarpAlgorithm(hGraph);
hEdmondsKarpAlgorithm.Execute(0, 7);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P5GraphG12;
hGraph = AdjacentListGraphImporter.ImportAdjacentList <CapacityWeighted>(hFileName, EdgeKind.DirectedWeighted);
hEdmondsKarpAlgorithm = new EdmondsKarpAlgorithm(hGraph);
hEdmondsKarpAlgorithm.Execute(0, 7);
}
private static void P4TSPBranchAndBound()
{
for (int i = 0; i < 4; i++)
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P3GraphFiles[i];
var hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.UndirectedWeighted);
var hTSPBruteForceAlgorithm = new TSPSolver(hGraph, true);
hTSPBruteForceAlgorithm.Execute();
}
}
private static void P3DoppelterBaum()
{
for (int i = 0; i < 11; i++)
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P3GraphFiles[i];
var hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.UndirectedWeighted);
var hDoppelterBaumAlgorithm = new DoppelterBaumAlgorithm(hGraph);
hDoppelterBaumAlgorithm.Execute(hGraph.GetNodeDictionary()[0]);
}
}
private static void P2Aufgaben()
{
foreach (var hCurrentGraphFile in GraphFileRessources.P2GraphFiles)
{
var hNewGraph = AdjacentListGraphImporter.ImportAdjacentList(hCurrentGraphFile, EdgeKind.UndirectedWeighted);
var hPrimAlgorithm = new PrimAlgorithm(hNewGraph);
var hMstPrim = hPrimAlgorithm.Execute();
var hKruskalAlgorithm = new KruskalAlgorithm(hNewGraph);
var hMstKruskal = hKruskalAlgorithm.Execute();
Console.WriteLine("");
}
}
private static void P7CycleCanceling()
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P7CostMinFluesse1;
var hGraph = AdjacentListGraphImporter.ImportAdjacentListBalancedNodesCostCapacityEdges(hFileName);
var hCycleCancelingAlgorithm = new CycleCancelingAlgorithm(hGraph);
hCycleCancelingAlgorithm.Execute();
var hSuccessiveShortestPath = new SuccessiveShortestPath(hGraph);
hSuccessiveShortestPath.Execute();
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P7CostMinFluesse2;
hGraph = AdjacentListGraphImporter.ImportAdjacentListBalancedNodesCostCapacityEdges(hFileName);
hCycleCancelingAlgorithm = new CycleCancelingAlgorithm(hGraph);
hCycleCancelingAlgorithm.Execute();
hSuccessiveShortestPath = new SuccessiveShortestPath(hGraph);
hSuccessiveShortestPath.Execute();
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P7CostMinFluesse3;
hGraph = AdjacentListGraphImporter.ImportAdjacentListBalancedNodesCostCapacityEdges(hFileName);
hCycleCancelingAlgorithm = new CycleCancelingAlgorithm(hGraph);
hCycleCancelingAlgorithm.Execute();
hSuccessiveShortestPath = new SuccessiveShortestPath(hGraph);
hSuccessiveShortestPath.Execute();
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P7CostMinFluesse4;
hGraph = AdjacentListGraphImporter.ImportAdjacentListBalancedNodesCostCapacityEdges(hFileName);
hCycleCancelingAlgorithm = new CycleCancelingAlgorithm(hGraph);
hCycleCancelingAlgorithm.Execute();
hSuccessiveShortestPath = new SuccessiveShortestPath(hGraph);
hSuccessiveShortestPath.Execute();
}
private static void P1Aufgaben()
{
var hFileName = GraphFileRessources.P1AdjacentGraph3Path;
var hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.UndirectedUnweighted);
FindSubTrees hFindSubTrees = new FindSubTrees(hGraph);
Console.WriteLine("--- FindSubTrees BFS ---");
hFindSubTrees.Execute <BreadthFirstSearch>();
hFindSubTrees.PrintInfosToConsole();
Console.WriteLine("--- FindSubTrees DFS ---");
hFindSubTrees.Execute <DepthFirstSearch>();
hFindSubTrees.PrintInfosToConsole();
}
private static void P8MaximaleMatching()
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P8MaxMatching;
var hGraph = AdjacentListGraphImporter.ImportAdjacentListMaxMatching(hFileName);
var hMaxMatchingAlgorithm = new MaxMatchingAlgorithm(hGraph, AdjacentListGraphImporter.FNodesGroupALimit);
hMaxMatchingAlgorithm.Execute();
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
hFileName = GraphFileRessources.P8MaxMatching2;
hGraph = AdjacentListGraphImporter.ImportAdjacentListMaxMatching(hFileName);
hMaxMatchingAlgorithm = new MaxMatchingAlgorithm(hGraph, AdjacentListGraphImporter.FNodesGroupALimit);
hMaxMatchingAlgorithm.Execute();
}
private static void P5DijkstraBellman()
{
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
var hFileName = GraphFileRessources.P4GraphWege1;
var hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.DirectedWeighted);
var hDijkstraAlgorithm = new Dijkstra(hGraph);
hDijkstraAlgorithm.Execute(2, 0);
var hBellmanFordAlgorithm = new BellmanFordAlgorithm(hGraph);
hBellmanFordAlgorithm.Execute(2, 0);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
Console.WriteLine("Gerichtet");
hFileName = GraphFileRessources.P4GraphWege2;
hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.DirectedWeighted);
hDijkstraAlgorithm = new Dijkstra(hGraph);
hDijkstraAlgorithm.Execute(2, 0);
hBellmanFordAlgorithm = new BellmanFordAlgorithm(hGraph);
hBellmanFordAlgorithm.Execute(2, 0);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
Console.WriteLine("Gerichtet");
hFileName = GraphFileRessources.P4GraphWege3;
hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.DirectedWeighted);
hDijkstraAlgorithm = new Dijkstra(hGraph);
hDijkstraAlgorithm.Execute(2, 0);
hBellmanFordAlgorithm = new BellmanFordAlgorithm(hGraph);
hBellmanFordAlgorithm.Execute(2, 0);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
Console.WriteLine("Gerichtet");
hFileName = GraphFileRessources.P4GraphG12;
hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.DirectedWeighted);
hDijkstraAlgorithm = new Dijkstra(hGraph);
hDijkstraAlgorithm.Execute(0, 1);
hBellmanFordAlgorithm = new BellmanFordAlgorithm(hGraph);
hBellmanFordAlgorithm.Execute(0, 1);
Console.WriteLine("-------------------------------");
Console.WriteLine("Neuer Graph");
Console.WriteLine("Ungerichtet");
hFileName = GraphFileRessources.P4GraphG12;
hGraph = AdjacentListGraphImporter.ImportAdjacentList(hFileName, EdgeKind.UndirectedWeighted);
hDijkstraAlgorithm = new Dijkstra(hGraph);
hDijkstraAlgorithm.Execute(0, 1);
hBellmanFordAlgorithm = new BellmanFordAlgorithm(hGraph);
hBellmanFordAlgorithm.Execute(0, 1);
}
