149 |
int beginDepth, int endDepth) { |
int beginDepth, int endDepth) { |
150 |
|
|
151 |
// Create CS (within place) and put it into mindNet |
// Create CS (within place) and put it into mindNet |
152 |
if (beginDepth < endDepth) { |
for (int i=0; i<links.size(); i++) { |
153 |
for (int i=0; i<links.size(); i++) { |
Object link = links.get(i); |
154 |
Object link = links.get(i); |
if (net.hasBeenLinked(centerNode, link)) continue; |
155 |
if (net.hasBeenLinked(centerNode, link)) continue; |
net.link(centerNode, link); |
156 |
net.link(centerNode, link); |
|
157 |
|
if (beginDepth < maxDepth) { |
158 |
if (net.getPlace(link) == null) { |
if (net.getPlace(link) == null) { |
159 |
MMPlace pl = getPlace(vs, into, x, y, link, |
MMPlace pl = getPlace(vs, into, x, y, link, |
160 |
startAngle+rotationAngle*i, |
startAngle+rotationAngle*i, |
161 |
beginDepth); |
beginDepth); |
162 |
net.put(link, pl, beginDepth); |
net.put(link, pl, beginDepth); |
163 |
} |
} |
164 |
} |
} |
165 |
} |
} |
166 |
|
|
|
|
|
167 |
// Another recursion step |
// Another recursion step |
168 |
if (beginDepth >= endDepth) return; |
if (beginDepth >= endDepth) return; |
169 |
for (int i=0; i<links.size(); i++) { |
for (int i=0; i<links.size(); i++) { |