public FruchtermanReingoldLayoutAlgorithm(IVertexAndEdgeListGraph graph, SizeF size) { this.size = size; this.graph = graph; this.pos = new VertexPointFDictionary(); this.disp = new VertexVector2DDictionary(); }
public ForceDirectedLayoutAlgorithm( IVertexAndEdgeListGraph visitedGraph ) : base(visitedGraph) { this.preLayoutAlgorithm=new RandomLayoutAlgorithm(visitedGraph,this.Positions); this.potential=new DirectedForcePotential(this); this.potentials=new VertexPointFDictionary(); }
public LargeGraphRenderer() { this.visitedGraph = null; this.positions = new VertexPointFDictionary(); this.edgeVisible = true; this.edgeRenderer = new QuickGraph.Algorithms.Layout.EdgeRenderer(); this.vertexVisible = true; this.vertexRenderer = new QuickGraph.Algorithms.Layout.VertexRenderer(); this.layoutSize = new Size(800, 600); }
public ForceDirectedLayoutAlgorithm( IVertexAndEdgeListGraph visitedGraph, IPotential potential, ILayoutAlgorithm preLayoutAlgorithm ) : base(visitedGraph) { this.preLayoutAlgorithm=preLayoutAlgorithm; this.potential=potential; this.potentials=new VertexPointFDictionary(); }
public LargeGraphRenderer(IVertexAndEdgeListGraph visitedGraph) { this.visitedGraph = null; this.positions = new VertexPointFDictionary(); this.edgeVisible = true; this.edgeRenderer = new QuickGraph.Algorithms.Layout.EdgeRenderer(); this.vertexVisible = true; this.vertexRenderer = new QuickGraph.Algorithms.Layout.VertexRenderer(); this.layoutSize = new Size(800, 600); if (visitedGraph == null) { throw new ArgumentNullException("visitedGraph"); } this.visitedGraph = visitedGraph; }
public ForceDirectedLayoutAlgorithm(IVertexAndEdgeListGraph visitedGraph, IPotential potential, ILayoutAlgorithm preLayoutAlgorithm) : base(visitedGraph) { this.preLayoutAlgorithm = null; this.potential = null; this.currentIteration = 0; this.maxIteration = 500; this.potentials = new VertexPointFDictionary(); this.maxMovement = 50f; this.heat = 1f; this.heatDecayRate = 0.99f; this.syncRoot = null; this.preLayoutAlgorithm = preLayoutAlgorithm; this.potential = potential; this.potentials = new VertexPointFDictionary(); }
public ForceDirectedLayoutAlgorithm(IVertexAndEdgeListGraph visitedGraph) : base(visitedGraph) { this.preLayoutAlgorithm = null; this.potential = null; this.currentIteration = 0; this.maxIteration = 500; this.potentials = new VertexPointFDictionary(); this.maxMovement = 50f; this.heat = 1f; this.heatDecayRate = 0.99f; this.syncRoot = null; this.preLayoutAlgorithm = new RandomLayoutAlgorithm(visitedGraph, base.Positions); this.potential = new DirectedForcePotential(this); this.potentials = new VertexPointFDictionary(); }