public void PrimMinimumSpanningTreeAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { Prim(g); } }
public void UndirectedDepthFirstSearchAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { RunUndirectedDepthFirstSearchAndCheck(graph); } }
public void UndirectedDepthFirstSearchAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { this.UndirectedDepthFirstSearch(g); } }
public void PrimKruskalMinimumSpanningTreeAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { CompareRoot(graph); } }
public void UndirectedFirstTopologicalSortAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { this.Compute(g); } }
public void PrimMinimumSpanningTreeAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { Prim(graph); } }
public void KruskalMinimumSpanningTreeAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { Kruskal(g); } }
public void PrimKruskalMinimumSpanningTreeAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { this.CompareRoot(g); } }
public void UndirectedFirstTopologicalSortAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { Compute(graph); } // TODO: Add assertions }
public void UndirectedBreadthFirstSearchAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { foreach (string vertex in graph.Vertices) { RunBfsAndCheck(graph, vertex); } } }
public void UndirectedBreadthFirstSearchAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => { foreach (var v in g.Vertices) { RunBfs(g, v); } }); }
public void UndirectedBreadthFirstSearchAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { foreach (var v in g.Vertices) { RunBfs(g, v); } } }
public void ConnectedComponentsAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => { while (g.EdgeCount > 0) { this.Compute(g); g.RemoveEdge(Enumerable.First(g.Edges)); } }); }
public void ConnectedComponentsAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { while (graph.EdgeCount > 0) { Compute(graph); graph.RemoveEdge(graph.Edges.First()); } } }
public void ConnectedComponentsAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { while (g.EdgeCount > 0) { this.Compute(g); g.RemoveEdge(Enumerable.First(g.Edges)); } } }
public void UndirectedDijkstraAll() { foreach (var g in TestGraphFactory.GetUndirectedGraphs()) { int cut = 0; foreach (var root in g.Vertices) { if (cut++ > 10) { break; } this.UndirectedDijkstra(g, root); } } }
public void UndirectedDijkstraAll() { System.Threading.Tasks.Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => { int cut = 0; foreach (var root in g.Vertices) { if (cut++ > 10) { break; } this.UndirectedDijkstra(g, root); } }); }
public void UndirectedDijkstraAll() { foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs()) { int cut = 0; foreach (var root in graph.Vertices) { if (cut++ > 10) { break; } RunUndirectedDijkstraAndCheck(graph, root); } } }
public void PrimKruskalMinimumSpanningTreeAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => this.CompareRoot(g)); }
public void UndirectedFirstTopologicalSortAll() { TestGraphFactory.GetUndirectedGraphs() .AsParallel() .ForAll(Compute); }
public void PrimMinimumSpanningTreeAll() { TestGraphFactory.GetUndirectedGraphs() .AsParallel() .ForAll(Prim); }
public void KruskalMinimumSpanningTreeAll() { TestGraphFactory.GetUndirectedGraphs() .AsParallel() .ForAll(Kruskal); }
public void PrimKruskalMinimumSpanningTreeAll() { TestGraphFactory.GetUndirectedGraphs() .AsParallel() .ForAll(g => CompareRoot(g)); }
public void UndirectedBreadthFirstSearchAll() { TestGraphFactory.GetUndirectedGraphs().AsParallel() .SelectMany(g => g.Vertices, (g, v) => new { Graph = g, Vertex = v }) .ForAll(x => { RunBfs(x.Graph, x.Vertex); }); }
public void UndirectedDepthFirstSearchAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => this.UndirectedDepthFirstSearch(g)); }
public void KruskalMinimumSpanningTreeAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => Kruskal(g)); }
public void PrimMinimumSpanningTreeAll() { Parallel.ForEach(TestGraphFactory.GetUndirectedGraphs(), g => Prim(g)); }
public void UndirectedDepthFirstSearchAll() { TestGraphFactory.GetUndirectedGraphs() .AsParallel() .ForAll(UndirectedDepthFirstSearch); }