Changeset 14283
- Timestamp:
- 09/16/16 15:36:59 (8 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/HeuristicLab.VariableInteractionNetworks/HeuristicLab.VariableInteractionNetworks.Views/3.3/Layout/ConstrainedForceDirectedLayout.cs
r14275 r14283 46 46 private ColaEdges edges; 47 47 private Cola.Doubles edgeLengths; 48 private int topologyNodeCount;48 //private int topologyNodeCount; 49 49 private Dictionary<uint, uint> idMap; 50 50 private Dictionary<IVertex, int> indexMap; … … 126 126 ++i; 127 127 } 128 topologyNodeCount = i;128 //topologyNodeCount = i; 129 129 edges = new ColaEdges(arcs.Select(x => new ColaEdge((uint)indexMap[x.Source], (uint)indexMap[x.Target])).ToList()); 130 130 edgeLengths = new Cola.Doubles(Enumerable.Range(0, edges.Count).Select(x => DefaultEdgeLength).ToList()); … … 219 219 /// <summary> 220 220 /// This method performs edge routing, meaning that edges are moved such that they go around the nodes. 221 /// Routing can produce polyline or orthogonal graph edges 221 /// Routing can produce polyline or orthogonal graph edges. 222 222 /// </summary> 223 223 private void RouteEdges() { … … 233 233 break; 234 234 default: 235 var id = topologyNode Count;235 var id = topologyNodes.Count; 236 236 foreach (var edge in edges) { 237 237 var eps = new TopologyEdgePointPtrs(); … … 250 250 router.InvisibilityGrph = false; 251 251 // consider topology routes only for the topologyNodes associated with our objects (the rectangles) 252 for (int i = 0; i < topologyNode Count; ++i) {252 for (int i = 0; i < topologyNodes.Count; ++i) { 253 253 var r = topologyNodes[i].rect; 254 254 var poly = new Polygon(4); … … 300 300 } 301 301 302 /// <summary> 303 /// Save the layouted graph to a svg file 304 /// </summary> 305 /// <param name="path">The save path.</param> 302 306 public void OutputInstanceToSVG(string path) { 303 307 alg.outputInstanceToSVG(path);
Note: See TracChangeset
for help on using the changeset viewer.