public void TopologicalSort_DCT8() { AdjacencyGraph <string, Edge <string> > graph = TestGraphFactory.LoadGraph(GetGraphFilePath("DCT8.graphml")); var topologicalSort = new TopologicalSortAlgorithm <string, Edge <string> >(graph); topologicalSort.Compute(); }
public void SortDCT8() { var g = TestGraphFactory.LoadGraph("GraphML/DCT8.graphml"); var topo = new TopologicalSortAlgorithm <string, Edge <string> >(g); Assert.IsFalse(topo.AllowCyclicGraph); topo.Compute(); }
public void NotEulerianTrailGraph() { var graph = TestGraphFactory.LoadGraph(GetGraphFilePath("g.42.34.graphml")); // No trails in tests graphs there ComputeTrails( graph, (s, t) => new Edge <string>(s, t), out ICollection <Edge <string> >[] trails, out Edge <string>[] circuit);
private object LoadSingleGraph(string path) { switch (this.Type) { case GraphType.AdjacencyGraph: return(TestGraphFactory.LoadGraph(path)); case GraphType.BidirectionalGraph: return(TestGraphFactory.LoadBidirectionalGraph(path)); case GraphType.UndirectedGraph: return(TestGraphFactory.LoadUndirectedGraph(path)); default: throw new NotSupportedException(); } }
public void DijkstraRepro12359() { AdjacencyGraph <string, Edge <string> > graph = TestGraphFactory.LoadGraph(GetGraphFilePath("repro12359.graphml")); int cut = 0; foreach (string root in graph.Vertices) { if (cut++ > 5) { break; } RunDijkstraAndCheck(graph, root); } }
public void Repro12359() { var g = TestGraphFactory.LoadGraph(Path.Combine("GraphML", "repro12359.graphml")); int i = 0; foreach (var v in g.Vertices) { if (i++ > 5) { break; } Dijkstra(g, v); } }
public void TopologicalSort_DCT8() { AdjacencyGraph <string, Edge <string> > graph = TestGraphFactory.LoadGraph(GetGraphFilePath("DCT8.graphml")); RunTopologicalSortAndCheck(graph); }