C# (CSharp) BidirectionalGraph.ShortestPathsBellmanFord Beispiele

Beispiel #1

 public void Repro12901()
 {
     Assert.Throws <InvalidOperationException>(() =>
     {
         var graph        = new BidirectionalGraph <int, Edge <int> >();
         const int vertex = 1;
         graph.AddVerticesAndEdge(new Edge <int>(vertex, vertex));
         var pathFinder = graph.ShortestPathsBellmanFord(edge => - 1.0, vertex);
         pathFinder(vertex, out _);
     });
 }