I am using QuickGraph version 3.6 and I found function SetRootVertex, but no SetTagretVertex. I need this because I am searching short paths in huge graph and this would speed up program a lot.
Clases in question are DijkstraShortestPathAlgorithm and AStarShortestPathAlgorithm.
I don't think there is a way to this without using events.
You could wrap the necessary code in one extension method, making things clear, e.g.:
public static class Extensions
{
class AStarWrapper<TVertex, TEdge>
where TEdge : IEdge<TVertex>
{
private TVertex target;
private AStarShortestPathAlgorithm<TVertex, TEdge> innerAlgorithm;
public AStarWrapper(AStarShortestPathAlgorithm<TVertex, TEdge> innerAlgo, TVertex root, TVertex target)
{
innerAlgorithm = innerAlgo;
this.innerAlgorithm.SetRootVertex(root);
this.target = target;
this.innerAlgorithm.FinishVertex += new VertexAction<TVertex>(innerAlgorithm_FinishVertex);
}
void innerAlgorithm_FinishVertex(TVertex vertex)
{
if (object.Equals(vertex, target))
this.innerAlgorithm.Abort();
}
public double Compute()
{
this.innerAlgorithm.Compute();
return this.innerAlgorithm.Distances[target];
}
}
public static double ComputeDistanceBetween<TVertex, TEdge>(this AStarShortestPathAlgorithm<TVertex, TEdge> algo, TVertex start, TVertex end)
where TEdge : IEdge<TVertex>
{
var wrap = new AStarWrapper<TVertex, TEdge>(algo, start, end);
return wrap.Compute();
}
}
Usage:
var g = new BidirectionalGraph<int, IEdge<int>>();
g.AddVerticesAndEdge(new Edge<int>(1, 2));
g.AddVerticesAndEdge(new Edge<int>(2, 3));
g.AddVerticesAndEdge(new Edge<int>(3, 4));
g.AddVerticesAndEdge(new Edge<int>(2, 4));
var astar =new AStarShortestPathAlgorithm<int,IEdge<int>>(g, x => 1.0, x => 0.0);
var dist = astar.ComputeDistanceBetween(2, 4);