Esempio n. 1
0
 public void InDegreeSumEqualsEdgeCount()
 {
     foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
     {
         AssertInDegreeSumEqualsEdgeCount(graph);
     }
 }
 public void MultiSourceSinkGraphAugmentor()
 {
     foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
     {
         RunAugmentationAndCheck(graph);
     }
 }
Esempio n. 3
0
 public void SourceFirstBidirectionalTopologicalSort()
 {
     foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
     {
         RunSourceFirstTopologicalSortAndCheck(graph, TopologicalSortDirection.Forward);
         RunSourceFirstTopologicalSortAndCheck(graph, TopologicalSortDirection.Backward);
     }
 }
Esempio n. 4
0
 public void OutDegreeSumEqualsEdgeCount()
 {
     foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
     {
         OutDegreeSumEqualsEdgeCount(graph);
     }
     foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
     {
         OutDegreeSumEqualsEdgeCount(graph);
     }
 }
 public void ConversionToArrayGraph()
 {
     foreach (AdjacencyGraph <string, Edge <string> > graph in TestGraphFactory.GetAdjacencyGraphs_All())
     {
         AssertSameProperties(graph);
     }
     foreach (BidirectionalGraph <string, Edge <string> > graph in TestGraphFactory.GetBidirectionalGraphs_All())
     {
         AssertSameProperties(graph);
     }
     foreach (UndirectedGraph <string, Edge <string> > graph in TestGraphFactory.GetUndirectedGraphs_All())
     {
         AssertSameProperties(graph);
     }
 }