Hi Jonathan,
This repro should do :
int
ii = 0;
BidirectionalGraph<int,
TaggedEdge<int,
int>> mvGraph2 =
new
BidirectionalGraph<int,
TaggedEdge<int,
int>>();
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(0, 1, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(1, 2, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(2, 3, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(3, 4, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(4, 5, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(5, 0, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(1, 5, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(5, 1, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(2, 5, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(1, 0, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(2, 1, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(3, 2, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(4, 3, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(5, 4, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(0, 5, ii++));
mvGraph2.AddVerticesAndEdge(
new
TaggedEdge<int,
int>(5, 2, ii++));
HoffmanPavleyRankedShortestPathAlgorithm<int,
TaggedEdge<int,
int>> test1 =
new
HoffmanPavleyRankedShortestPathAlgorithm<int,
TaggedEdge<int,
int>>(mvGraph2, E => 1.0);
test1.ShortestPathCount = 5;
//int.MaxValue;
test1.Compute(5, 2);
Thanks for the support!
Have a nice weekend,
Frank
