public void RefreshAlgorithm(CircleNodeScene scene)
{
if (this.IsDirty)
{
this.mAlg = this.Create(scene);
this.mAlg.Compute();
this.IsDirty = false;
}
}
public KKLayoutAlgorithm(Digraph <Node, Edge> graph,
Box2F boundingBox)
: base(graph, boundingBox)
{
this.mShortestPathsAlg
= new BasicAllShortestPaths <Node, Edge>(
new DijkstraShortestPath <Node, Edge>(
graph, false, false));
this.mXs = new double[0];
this.mYs = new double[0];
this.mHidden = new bool[0];
this.MaxIterations = 200;
}
