1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<!--NewPage-->
<HTML>
<HEAD>
<!-- Generated by javadoc (build 1.5.0_16) on Tue Jan 19 16:26:49 GMT 2010 -->
<TITLE>
mxOrganicLayout (JGraph X 1.2.0.8 API Specification)
</TITLE>
<META NAME="keywords" CONTENT="com.mxgraph.layout.mxOrganicLayout class">
<LINK REL ="stylesheet" TYPE="text/css" HREF="../../../stylesheet.css" TITLE="Style">
<SCRIPT type="text/javascript">
function windowTitle()
{
parent.document.title="mxOrganicLayout (JGraph X 1.2.0.8 API Specification)";
}
</SCRIPT>
<NOSCRIPT>
</NOSCRIPT>
</HEAD>
<BODY BGCOLOR="white" onload="windowTitle();">
<!-- ========= START OF TOP NAVBAR ======= -->
<A NAME="navbar_top"><!-- --></A>
<A HREF="#skip-navbar_top" title="Skip navigation links"></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_top_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/mxOrganicLayout.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
<p><b>JGraph X 1.2.0.8</b></p></EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../com/mxgraph/layout/mxIGraphLayout.html" title="interface in com.mxgraph.layout"><B>PREV CLASS</B></A>
<A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../index.html?com/mxgraph/layout/mxOrganicLayout.html" target="_top"><B>FRAMES</B></A>
<A HREF="mxOrganicLayout.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
SUMMARY: <A HREF="#nested_class_summary">NESTED</A> | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_top"></A>
<!-- ========= END OF TOP NAVBAR ========= -->
<HR>
<!-- ======== START OF CLASS DATA ======== -->
<H2>
<FONT SIZE="-1">
com.mxgraph.layout</FONT>
<BR>
Class mxOrganicLayout</H2>
<PRE>
<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">java.lang.Object</A>
<IMG SRC="../../../resources/inherit.gif" ALT="extended by "><A HREF="../../../com/mxgraph/layout/mxGraphLayout.html" title="class in com.mxgraph.layout">com.mxgraph.layout.mxGraphLayout</A>
<IMG SRC="../../../resources/inherit.gif" ALT="extended by "><B>com.mxgraph.layout.mxOrganicLayout</B>
</PRE>
<DL>
<DT><B>All Implemented Interfaces:</B> <DD><A HREF="../../../com/mxgraph/layout/mxIGraphLayout.html" title="interface in com.mxgraph.layout">mxIGraphLayout</A></DD>
</DL>
<HR>
<DL>
<DT><PRE>public class <B>mxOrganicLayout</B><DT>extends <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html" title="class in com.mxgraph.layout">mxGraphLayout</A></DL>
</PRE>
<P>
An implementation of a simulated annealing layout, based on "Drawing Graphs
Nicely Using Simulated Annealing" by Davidson and Harel (1996). This
paper describes these criteria as being favourable in a graph layout: (1)
distributing nodes evenly, (2) making edge-lengths uniform, (3)
minimizing cross-crossings, and (4) keeping nodes from coming too close
to edges. These criteria are translated into energy cost functions in the
layout. Nodes or edges breaking these criteria create a larger cost function
, the total cost they contribute related to the extent that they break it.
The idea of the algorithm is to minimise the total system energy. Factors
are assigned to each of the criteria describing how important that
criteria is. Higher factors mean that those criteria are deemed to be
relatively preferable in the final layout. Most of the criteria conflict
with the others to some extent and so the setting of the factors determines
the general look of the resulting graph.
<p>
In addition to the four aesthetic criteria the concept of a border line
which induces an energy cost to nodes in proximity to the graph bounds is
introduced to attempt to restrain the graph. All of the 5 factors can be
switched on or off using the <code>isOptimize...</code> variables.
<p>
Simulated Annealing is a force-directed layout and is one of the more
expensive, but generally effective layouts of this type. Layouts like
the spring layout only really factor in edge length and inter-node
distance being the lowest CPU intensive for the most aesthetic gain. The
additional factors are more expensive but can have very attractive results.
<p>
The main loop of the algorithm consist of processing the nodes in a
deterministic order. During the processing of each node a circle of radius
<code>moveRadius</code> is made around the node and split into
<code>triesPerCell</code> equal segments. Each point between neighbour
segments is determined and the new energy of the system if the node were
moved to that position calculated. Only the necessary nodes and edges are
processed new energy values resulting in quadratic performance, O(VE),
whereas calculating the total system energy would be cubic. The default
implementation only checks 8 points around the radius of the circle, as
opposed to the suggested 30 in the paper. Doubling the number of points
double the CPU load and 8 works almost as well as 30.
<p>
The <code>moveRadius</code> replaces the temperature as the influencing
factor in the way the graph settles in later iterations. If the user does
not set the initial move radius it is set to half the maximum dimension
of the graph. Thus, in 2 iterations a node may traverse the entire graph,
and it is more sensible to find minima this way that uphill moves, which
are little more than an expensive 'tilt' method. The factor by which
the radius is multiplied by after each iteration is important, lowering
it improves performance but raising it towards 1.0 can improve the
resulting graph aesthetics. When the radius hits the minimum move radius
defined, the layout terminates. The minimum move radius should be set
a value where the move distance is too minor to be of interest.
<p>
Also, the idea of a fine tuning phase is used, as described in the paper.
This involves only calculating the edge to node distance energy cost
at the end of the algorithm since it is an expensive calculation and
it really an 'optimizating' function. <code>fineTuningRadius</code>
defines the radius value that, when reached, causes the edge to node
distance to be calculated.
<p>
There are other special cases that are processed after each iteration.
<code>unchangedEnergyRoundTermination</code> defines the number of
iterations, after which the layout terminates. If nothing is being moved
it is assumed a good layout has been found. In addition to this if
no nodes are moved during an iteration the move radius is halved, presuming
that a finer granularity is required.
<P>
<P>
<HR>
<P>
<!-- ======== NESTED CLASS SUMMARY ======== -->
<A NAME="nested_class_summary"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
<B>Nested Class Summary</B></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> class</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout">mxOrganicLayout.CellWrapper</A></B></CODE>
<BR>
Internal representation of a node or edge that holds cached information
to enable the layout to perform more quickly and to simplify the code</TD>
</TR>
</TABLE>
<!-- =========== FIELD SUMMARY =========== -->
<A NAME="field_summary"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
<B>Field Summary</B></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#approxNodeDimensions">approxNodeDimensions</A></B></CODE>
<BR>
Whether or not to use approximate node dimensions or not.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#averageNodeArea">averageNodeArea</A></B></CODE>
<BR>
The average amount of area allocated per node.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#borderLineCostFactor">borderLineCostFactor</A></B></CODE>
<BR>
Cost factor applied to energy calculations for node promixity to the
notional border of the graph.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#boundsHeight">boundsHeight</A></B></CODE>
<BR>
The height coordinate of the final graph</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#boundsWidth">boundsWidth</A></B></CODE>
<BR>
The width coordinate of the final graph</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#boundsX">boundsX</A></B></CODE>
<BR>
The x coordinate of the final graph</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#boundsY">boundsY</A></B></CODE>
<BR>
The y coordinate of the final graph</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout">mxOrganicLayout.CellWrapper</A>[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#e">e</A></B></CODE>
<BR>
Internal models collection of edges to be laid out</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#edgeCrossingCostFactor">edgeCrossingCostFactor</A></B></CODE>
<BR>
Cost factor applied to energy calculations involving edges that cross
over one another.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#edgeDistanceCostFactor">edgeDistanceCostFactor</A></B></CODE>
<BR>
Cost factor applied to energy calculations involving the distance
nodes and edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#edgeLengthCostFactor">edgeLengthCostFactor</A></B></CODE>
<BR>
Cost factor applied to energy calculations for the edge lengths.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#fineTuningRadius">fineTuningRadius</A></B></CODE>
<BR>
The radius below which fine tuning of the layout should start
This involves allowing the distance between nodes and edges to be
taken into account in the total energy calculation.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#initialMoveRadius">initialMoveRadius</A></B></CODE>
<BR>
The initial value of <code>moveRadius</code>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isFineTuning">isFineTuning</A></B></CODE>
<BR>
Whether or not fine tuning is on.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeBorderLine">isOptimizeBorderLine</A></B></CODE>
<BR>
Whether or not nodes will contribute an energy cost as they approach
the bound of the graph.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeCrossing">isOptimizeEdgeCrossing</A></B></CODE>
<BR>
Whether or not edges crosses will be calculated as an energy cost
function.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeDistance">isOptimizeEdgeDistance</A></B></CODE>
<BR>
Whether or not the distance between edge and nodes will be calculated
as an energy cost function.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeLength">isOptimizeEdgeLength</A></B></CODE>
<BR>
Whether or not edge lengths will be calculated as an energy cost
function.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeNodeDistribution">isOptimizeNodeDistribution</A></B></CODE>
<BR>
Whether or not node distribute will contribute an energy cost where
nodes are close together.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#iteration">iteration</A></B></CODE>
<BR>
current iteration number of the layout</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#maxDistanceLimit">maxDistanceLimit</A></B></CODE>
<BR>
distance limit beyond which energy costs due to object repulsive is
not calculated as it would be too insignificant</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#maxDistanceLimitSquared">maxDistanceLimitSquared</A></B></CODE>
<BR>
cached version of <code>maxDistanceLimit</code> squared</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#maxIterations">maxIterations</A></B></CODE>
<BR>
Limit to the number of iterations that may take place.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#minDistanceLimit">minDistanceLimit</A></B></CODE>
<BR>
prevents from dividing with zero and from creating excessive energy
values</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#minDistanceLimitSquared">minDistanceLimitSquared</A></B></CODE>
<BR>
cached version of <code>minDistanceLimit</code> squared</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#minMoveRadius">minMoveRadius</A></B></CODE>
<BR>
when <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#moveRadius"><CODE>moveRadius</CODE></A>reaches this value, the algorithm is terminated</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#moveRadius">moveRadius</A></B></CODE>
<BR>
The current radius around each node where the next position energy
values will be calculated for a possible move</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#nodeDistributionCostFactor">nodeDistributionCostFactor</A></B></CODE>
<BR>
Cost factor applied to energy calculations involving the general node
distribution of the graph.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#radiusScaleFactor">radiusScaleFactor</A></B></CODE>
<BR>
The factor by which the <code>moveRadius</code> is multiplied by after
every iteration.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#triesPerCell">triesPerCell</A></B></CODE>
<BR>
determines, in how many segments the circle around cells is divided, to
find a new position for the cell.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#unchangedEnergyRoundCount">unchangedEnergyRoundCount</A></B></CODE>
<BR>
Keeps track of how many consecutive round have passed without any energy
changes</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#unchangedEnergyRoundTermination">unchangedEnergyRoundTermination</A></B></CODE>
<BR>
The number of round of no node moves taking placed that the layout
terminates</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout">mxOrganicLayout.CellWrapper</A>[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#v">v</A></B></CODE>
<BR>
Internal models collection of nodes ( vertices ) to be laid out</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#xNormTry">xNormTry</A></B></CODE>
<BR>
Array of the x portion of the normalised test vectors that
are tested for a lower energy around each vertex.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#yNormTry">yNormTry</A></B></CODE>
<BR>
Array of the y portion of the normalised test vectors that
are tested for a lower energy around each vertex.</TD>
</TR>
</TABLE>
<A NAME="fields_inherited_from_class_com.mxgraph.layout.mxGraphLayout"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TH ALIGN="left"><B>Fields inherited from class com.mxgraph.layout.<A HREF="../../../com/mxgraph/layout/mxGraphLayout.html" title="class in com.mxgraph.layout">mxGraphLayout</A></B></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#graph">graph</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#useBoundingBox">useBoundingBox</A></CODE></TD>
</TR>
</TABLE>
<!-- ======== CONSTRUCTOR SUMMARY ======== -->
<A NAME="constructor_summary"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
<B>Constructor Summary</B></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#mxOrganicLayout(com.mxgraph.view.mxGraph)">mxOrganicLayout</A></B>(<A HREF="../../../com/mxgraph/view/mxGraph.html" title="class in com.mxgraph.view">mxGraph</A> graph)</CODE>
<BR>
Constructor for mxOrganicLayout.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#mxOrganicLayout(com.mxgraph.view.mxGraph, java.awt.geom.Rectangle2D)">mxOrganicLayout</A></B>(<A HREF="../../../com/mxgraph/view/mxGraph.html" title="class in com.mxgraph.view">mxGraph</A> graph,
<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/awt/geom/Rectangle2D.html" title="class or interface in java.awt.geom">Rectangle2D</A> bounds)</CODE>
<BR>
Constructor for mxOrganicLayout.</TD>
</TR>
</TABLE>
<!-- ========== METHOD SUMMARY =========== -->
<A NAME="method_summary"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="2"><FONT SIZE="+2">
<B>Method Summary</B></FONT></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#calcEnergyDelta(int, double, double, double, double, double, double)">calcEnergyDelta</A></B>(int index,
double oldNodeDistribution,
double oldEdgeDistance,
double oldEdgeCrossing,
double oldBorderLine,
double oldEdgeLength,
double oldAdditionalFactorsEnergy)</CODE>
<BR>
Calculates the change in energy for the specified node.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#execute(java.lang.Object)">execute</A></B>(<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A> parent)</CODE>
<BR>
Implements <mxGraphLayout.execute>.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getAdditionFactorsEnergy(int)">getAdditionFactorsEnergy</A></B>(int i)</CODE>
<BR>
Hook method to adding additional energy factors into the layout.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getAverageNodeArea()">getAverageNodeArea</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getBorderline(int)">getBorderline</A></B>(int i)</CODE>
<BR>
This method calculates the energy of the distance of the specified
node to the notional border of the graph.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getBorderLineCostFactor()">getBorderLineCostFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getConnectedEdges(int)">getConnectedEdges</A></B>(int cellIndex)</CODE>
<BR>
Returns all Edges that are connected with the specified cell</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeCrossing(int)">getEdgeCrossing</A></B>(int i)</CODE>
<BR>
This method calculates the energy of the distance from the specified
edge crossing any other edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeCrossingAffectedEdges(int)">getEdgeCrossingAffectedEdges</A></B>(int node)</CODE>
<BR>
Obtains the energy cost function for the specified node being moved.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeCrossingCostFactor()">getEdgeCrossingCostFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeDistanceAffectedNodes(int)">getEdgeDistanceAffectedNodes</A></B>(int node)</CODE>
<BR>
Obtains the energy cost function for the specified node being moved.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeDistanceCostFactor()">getEdgeDistanceCostFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeDistanceFromEdge(int)">getEdgeDistanceFromEdge</A></B>(int i)</CODE>
<BR>
This method calculates the energy of the distance between Cells and
Edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeDistanceFromNode(int)">getEdgeDistanceFromNode</A></B>(int i)</CODE>
<BR>
This method calculates the energy of the distance between Cells and
Edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeLength(int)">getEdgeLength</A></B>(int i)</CODE>
<BR>
This method calculates the energy due to the length of the specified
edge.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeLengthAffectedEdges(int)">getEdgeLengthAffectedEdges</A></B>(int node)</CODE>
<BR>
Obtains the energy cost function for the specified node being moved.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getEdgeLengthCostFactor()">getEdgeLengthCostFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getFineTuningRadius()">getFineTuningRadius</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getInitialMoveRadius()">getInitialMoveRadius</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getMaxDistanceLimit()">getMaxDistanceLimit</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getMaxIterations()">getMaxIterations</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getMinDistanceLimit()">getMinDistanceLimit</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getMinMoveRadius()">getMinMoveRadius</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getNodeDistribution(int)">getNodeDistribution</A></B>(int i)</CODE>
<BR>
Calculates the energy cost of the specified node relative to all other
nodes.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getNodeDistributionCostFactor()">getNodeDistributionCostFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> double</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getRadiusScaleFactor()">getRadiusScaleFactor</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected int[]</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getRelevantEdges(int)">getRelevantEdges</A></B>(int cellIndex)</CODE>
<BR>
Returns all Edges that are not connected to the specifed cell</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getTriesPerCell()">getTriesPerCell</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> int</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#getUnchangedEnergyRoundTermination()">getUnchangedEnergyRoundTermination</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isApproxNodeDimensions()">isApproxNodeDimensions</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isFineTuning()">isFineTuning</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeBorderLine()">isOptimizeBorderLine</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeCrossing()">isOptimizeEdgeCrossing</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeDistance()">isOptimizeEdgeDistance</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeEdgeLength()">isOptimizeEdgeLength</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isOptimizeNodeDistribution()">isOptimizeNodeDistribution</A></B>()</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> boolean</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#isVertexIgnored(java.lang.Object)">isVertexIgnored</A></B>(<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A> vertex)</CODE>
<BR>
Returns true if the given vertex has no connected edges.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE>protected void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#performRound()">performRound</A></B>()</CODE>
<BR>
The main round of the algorithm.</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setApproxNodeDimensions(boolean)">setApproxNodeDimensions</A></B>(boolean approxNodeDimensions)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setAverageNodeArea(double)">setAverageNodeArea</A></B>(double averageNodeArea)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setBorderLineCostFactor(double)">setBorderLineCostFactor</A></B>(double borderLineCostFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setEdgeCrossingCostFactor(double)">setEdgeCrossingCostFactor</A></B>(double edgeCrossingCostFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setEdgeDistanceCostFactor(double)">setEdgeDistanceCostFactor</A></B>(double edgeDistanceCostFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setEdgeLengthCostFactor(double)">setEdgeLengthCostFactor</A></B>(double edgeLengthCostFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setFineTuning(boolean)">setFineTuning</A></B>(boolean isFineTuning)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setFineTuningRadius(double)">setFineTuningRadius</A></B>(double fineTuningRadius)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setInitialMoveRadius(double)">setInitialMoveRadius</A></B>(double initialMoveRadius)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setMaxDistanceLimit(double)">setMaxDistanceLimit</A></B>(double maxDistanceLimit)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setMaxIterations(int)">setMaxIterations</A></B>(int maxIterations)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setMinDistanceLimit(double)">setMinDistanceLimit</A></B>(double minDistanceLimit)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setMinMoveRadius(double)">setMinMoveRadius</A></B>(double minMoveRadius)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setNodeDistributionCostFactor(double)">setNodeDistributionCostFactor</A></B>(double nodeDistributionCostFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setOptimizeBorderLine(boolean)">setOptimizeBorderLine</A></B>(boolean isOptimizeBorderLine)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setOptimizeEdgeCrossing(boolean)">setOptimizeEdgeCrossing</A></B>(boolean isOptimizeEdgeCrossing)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setOptimizeEdgeDistance(boolean)">setOptimizeEdgeDistance</A></B>(boolean isOptimizeEdgeDistance)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setOptimizeEdgeLength(boolean)">setOptimizeEdgeLength</A></B>(boolean isOptimizeEdgeLength)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setOptimizeNodeDistribution(boolean)">setOptimizeNodeDistribution</A></B>(boolean isOptimizeNodeDistribution)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setRadiusScaleFactor(double)">setRadiusScaleFactor</A></B>(double radiusScaleFactor)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setTriesPerCell(int)">setTriesPerCell</A></B>(int triesPerCell)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> void</CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#setUnchangedEnergyRoundTermination(int)">setUnchangedEnergyRoundTermination</A></B>(int unchangedEnergyRoundTermination)</CODE>
<BR>
</TD>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD ALIGN="right" VALIGN="top" WIDTH="1%"><FONT SIZE="-1">
<CODE> <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/String.html" title="class or interface in java.lang">String</A></CODE></FONT></TD>
<TD><CODE><B><A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#toString()">toString</A></B>()</CODE>
<BR>
Returns <code>Organic</code>, the name of this algorithm.</TD>
</TR>
</TABLE>
<A NAME="methods_inherited_from_class_com.mxgraph.layout.mxGraphLayout"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TH ALIGN="left"><B>Methods inherited from class com.mxgraph.layout.<A HREF="../../../com/mxgraph/layout/mxGraphLayout.html" title="class in com.mxgraph.layout">mxGraphLayout</A></B></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#getConstraint(java.lang.Object, java.lang.Object)">getConstraint</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#getConstraint(java.lang.Object, java.lang.Object, java.lang.Object, boolean)">getConstraint</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#getGraph()">getGraph</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#getVertexBounds(java.lang.Object)">getVertexBounds</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#isEdgeIgnored(java.lang.Object)">isEdgeIgnored</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#isUseBoundingBox()">isUseBoundingBox</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#isVertexMovable(java.lang.Object)">isVertexMovable</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#moveCell(java.lang.Object, double, double)">moveCell</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#setEdgePoints(java.lang.Object, java.util.List)">setEdgePoints</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#setEdgeStyleEnabled(java.lang.Object, boolean)">setEdgeStyleEnabled</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#setUseBoundingBox(boolean)">setUseBoundingBox</A>, <A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#setVertexLocation(java.lang.Object, double, double)">setVertexLocation</A></CODE></TD>
</TR>
</TABLE>
<A NAME="methods_inherited_from_class_java.lang.Object"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#EEEEFF" CLASS="TableSubHeadingColor">
<TH ALIGN="left"><B>Methods inherited from class java.lang.<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A></B></TH>
</TR>
<TR BGCOLOR="white" CLASS="TableRowColor">
<TD><CODE><A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#clone()" title="class or interface in java.lang">clone</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#equals(java.lang.Object)" title="class or interface in java.lang">equals</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#finalize()" title="class or interface in java.lang">finalize</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#getClass()" title="class or interface in java.lang">getClass</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#hashCode()" title="class or interface in java.lang">hashCode</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#notify()" title="class or interface in java.lang">notify</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#notifyAll()" title="class or interface in java.lang">notifyAll</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#wait()" title="class or interface in java.lang">wait</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#wait(long)" title="class or interface in java.lang">wait</A>, <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#wait(long, int)" title="class or interface in java.lang">wait</A></CODE></TD>
</TR>
</TABLE>
<P>
<!-- ============ FIELD DETAIL =========== -->
<A NAME="field_detail"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2">
<B>Field Detail</B></FONT></TH>
</TR>
</TABLE>
<A NAME="isOptimizeEdgeDistance"><!-- --></A><H3>
isOptimizeEdgeDistance</H3>
<PRE>
protected boolean <B>isOptimizeEdgeDistance</B></PRE>
<DL>
<DD>Whether or not the distance between edge and nodes will be calculated
as an energy cost function. This function is CPU intensive and is best
only used in the fine tuning phase.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="isOptimizeEdgeCrossing"><!-- --></A><H3>
isOptimizeEdgeCrossing</H3>
<PRE>
protected boolean <B>isOptimizeEdgeCrossing</B></PRE>
<DL>
<DD>Whether or not edges crosses will be calculated as an energy cost
function. This function is CPU intensive, though if some iterations
without it are required, it is best to have a few cycles at the start
of the algorithm using it, then use it intermittantly through the rest
of the layout.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="isOptimizeEdgeLength"><!-- --></A><H3>
isOptimizeEdgeLength</H3>
<PRE>
protected boolean <B>isOptimizeEdgeLength</B></PRE>
<DL>
<DD>Whether or not edge lengths will be calculated as an energy cost
function. This function not CPU intensive.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="isOptimizeBorderLine"><!-- --></A><H3>
isOptimizeBorderLine</H3>
<PRE>
protected boolean <B>isOptimizeBorderLine</B></PRE>
<DL>
<DD>Whether or not nodes will contribute an energy cost as they approach
the bound of the graph. The cost increases to a limit close to the
border and stays constant outside the bounds of the graph. This function
is not CPU intensive
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="isOptimizeNodeDistribution"><!-- --></A><H3>
isOptimizeNodeDistribution</H3>
<PRE>
protected boolean <B>isOptimizeNodeDistribution</B></PRE>
<DL>
<DD>Whether or not node distribute will contribute an energy cost where
nodes are close together. The function is moderately CPU intensive.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="minMoveRadius"><!-- --></A><H3>
minMoveRadius</H3>
<PRE>
protected double <B>minMoveRadius</B></PRE>
<DL>
<DD>when <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.html#moveRadius"><CODE>moveRadius</CODE></A>reaches this value, the algorithm is terminated
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="moveRadius"><!-- --></A><H3>
moveRadius</H3>
<PRE>
protected double <B>moveRadius</B></PRE>
<DL>
<DD>The current radius around each node where the next position energy
values will be calculated for a possible move
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="initialMoveRadius"><!-- --></A><H3>
initialMoveRadius</H3>
<PRE>
protected double <B>initialMoveRadius</B></PRE>
<DL>
<DD>The initial value of <code>moveRadius</code>. If this is set to zero
the layout will automatically determine a suitable value.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="radiusScaleFactor"><!-- --></A><H3>
radiusScaleFactor</H3>
<PRE>
protected double <B>radiusScaleFactor</B></PRE>
<DL>
<DD>The factor by which the <code>moveRadius</code> is multiplied by after
every iteration. A value of 0.75 is a good balance between performance
and aesthetics. Increasing the value provides more chances to find
minimum energy positions and decreasing it causes the minimum radius
termination condition to occur more quickly.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="averageNodeArea"><!-- --></A><H3>
averageNodeArea</H3>
<PRE>
protected double <B>averageNodeArea</B></PRE>
<DL>
<DD>The average amount of area allocated per node. If <code> bounds</code>
is not set this value mutiplied by the number of nodes to find
the total graph area. The graph is assumed square.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="fineTuningRadius"><!-- --></A><H3>
fineTuningRadius</H3>
<PRE>
protected double <B>fineTuningRadius</B></PRE>
<DL>
<DD>The radius below which fine tuning of the layout should start
This involves allowing the distance between nodes and edges to be
taken into account in the total energy calculation. If this is set to
zero, the layout will automatically determine a suitable value
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="maxIterations"><!-- --></A><H3>
maxIterations</H3>
<PRE>
protected int <B>maxIterations</B></PRE>
<DL>
<DD>Limit to the number of iterations that may take place. This is only
reached if one of the termination conditions does not occur first.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="edgeDistanceCostFactor"><!-- --></A><H3>
edgeDistanceCostFactor</H3>
<PRE>
protected double <B>edgeDistanceCostFactor</B></PRE>
<DL>
<DD>Cost factor applied to energy calculations involving the distance
nodes and edges. Increasing this value tends to cause nodes to move away
from edges, at the partial cost of other graph aesthetics.
<code>isOptimizeEdgeDistance</code> must be true for edge to nodes
distances to be taken into account.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="edgeCrossingCostFactor"><!-- --></A><H3>
edgeCrossingCostFactor</H3>
<PRE>
protected double <B>edgeCrossingCostFactor</B></PRE>
<DL>
<DD>Cost factor applied to energy calculations involving edges that cross
over one another. Increasing this value tends to result in fewer edge
crossings, at the partial cost of other graph aesthetics.
<code>isOptimizeEdgeCrossing</code> must be true for edge crossings
to be taken into account.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="nodeDistributionCostFactor"><!-- --></A><H3>
nodeDistributionCostFactor</H3>
<PRE>
protected double <B>nodeDistributionCostFactor</B></PRE>
<DL>
<DD>Cost factor applied to energy calculations involving the general node
distribution of the graph. Increasing this value tends to result in
a better distribution of nodes across the available space, at the
partial cost of other graph aesthetics.
<code>isOptimizeNodeDistribution</code> must be true for this general
distribution to be applied.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="borderLineCostFactor"><!-- --></A><H3>
borderLineCostFactor</H3>
<PRE>
protected double <B>borderLineCostFactor</B></PRE>
<DL>
<DD>Cost factor applied to energy calculations for node promixity to the
notional border of the graph. Increasing this value results in
nodes tending towards the centre of the drawing space, at the
partial cost of other graph aesthetics.
<code>isOptimizeBorderLine</code> must be true for border
repulsion to be applied.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="edgeLengthCostFactor"><!-- --></A><H3>
edgeLengthCostFactor</H3>
<PRE>
protected double <B>edgeLengthCostFactor</B></PRE>
<DL>
<DD>Cost factor applied to energy calculations for the edge lengths.
Increasing this value results in the layout attempting to shorten all
edges to the minimum edge length, at the partial cost of other graph
aesthetics.
<code>isOptimizeEdgeLength</code> must be true for edge length
shortening to be applied.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="boundsX"><!-- --></A><H3>
boundsX</H3>
<PRE>
protected double <B>boundsX</B></PRE>
<DL>
<DD>The x coordinate of the final graph
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="boundsY"><!-- --></A><H3>
boundsY</H3>
<PRE>
protected double <B>boundsY</B></PRE>
<DL>
<DD>The y coordinate of the final graph
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="boundsWidth"><!-- --></A><H3>
boundsWidth</H3>
<PRE>
protected double <B>boundsWidth</B></PRE>
<DL>
<DD>The width coordinate of the final graph
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="boundsHeight"><!-- --></A><H3>
boundsHeight</H3>
<PRE>
protected double <B>boundsHeight</B></PRE>
<DL>
<DD>The height coordinate of the final graph
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="iteration"><!-- --></A><H3>
iteration</H3>
<PRE>
protected int <B>iteration</B></PRE>
<DL>
<DD>current iteration number of the layout
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="triesPerCell"><!-- --></A><H3>
triesPerCell</H3>
<PRE>
protected int <B>triesPerCell</B></PRE>
<DL>
<DD>determines, in how many segments the circle around cells is divided, to
find a new position for the cell. Doubling this value doubles the CPU
load. Increasing it beyond 16 might mean a change to the
<code>performRound</code> method might further improve accuracy for a
small performance hit. The change is described in the method comment.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="minDistanceLimit"><!-- --></A><H3>
minDistanceLimit</H3>
<PRE>
protected double <B>minDistanceLimit</B></PRE>
<DL>
<DD>prevents from dividing with zero and from creating excessive energy
values
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="minDistanceLimitSquared"><!-- --></A><H3>
minDistanceLimitSquared</H3>
<PRE>
protected double <B>minDistanceLimitSquared</B></PRE>
<DL>
<DD>cached version of <code>minDistanceLimit</code> squared
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="maxDistanceLimit"><!-- --></A><H3>
maxDistanceLimit</H3>
<PRE>
protected double <B>maxDistanceLimit</B></PRE>
<DL>
<DD>distance limit beyond which energy costs due to object repulsive is
not calculated as it would be too insignificant
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="maxDistanceLimitSquared"><!-- --></A><H3>
maxDistanceLimitSquared</H3>
<PRE>
protected double <B>maxDistanceLimitSquared</B></PRE>
<DL>
<DD>cached version of <code>maxDistanceLimit</code> squared
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="unchangedEnergyRoundCount"><!-- --></A><H3>
unchangedEnergyRoundCount</H3>
<PRE>
protected int <B>unchangedEnergyRoundCount</B></PRE>
<DL>
<DD>Keeps track of how many consecutive round have passed without any energy
changes
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="unchangedEnergyRoundTermination"><!-- --></A><H3>
unchangedEnergyRoundTermination</H3>
<PRE>
protected int <B>unchangedEnergyRoundTermination</B></PRE>
<DL>
<DD>The number of round of no node moves taking placed that the layout
terminates
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="approxNodeDimensions"><!-- --></A><H3>
approxNodeDimensions</H3>
<PRE>
protected boolean <B>approxNodeDimensions</B></PRE>
<DL>
<DD>Whether or not to use approximate node dimensions or not. Set to true
the radius squared of the smaller dimension is used. Set to false the
radiusSquared variable of the CellWrapper contains the width squared
and heightSquared is used in the obvious manner.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="v"><!-- --></A><H3>
v</H3>
<PRE>
protected <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout">mxOrganicLayout.CellWrapper</A>[] <B>v</B></PRE>
<DL>
<DD>Internal models collection of nodes ( vertices ) to be laid out
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="e"><!-- --></A><H3>
e</H3>
<PRE>
protected <A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout">mxOrganicLayout.CellWrapper</A>[] <B>e</B></PRE>
<DL>
<DD>Internal models collection of edges to be laid out
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="xNormTry"><!-- --></A><H3>
xNormTry</H3>
<PRE>
protected double[] <B>xNormTry</B></PRE>
<DL>
<DD>Array of the x portion of the normalised test vectors that
are tested for a lower energy around each vertex. The vector
of the combined x and y normals are multipled by the current
radius to obtain test points for each vector in the array.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="yNormTry"><!-- --></A><H3>
yNormTry</H3>
<PRE>
protected double[] <B>yNormTry</B></PRE>
<DL>
<DD>Array of the y portion of the normalised test vectors that
are tested for a lower energy around each vertex. The vector
of the combined x and y normals are multipled by the current
radius to obtain test points for each vector in the array.
<P>
<DL>
</DL>
</DL>
<HR>
<A NAME="isFineTuning"><!-- --></A><H3>
isFineTuning</H3>
<PRE>
protected boolean <B>isFineTuning</B></PRE>
<DL>
<DD>Whether or not fine tuning is on. The determines whether or not
node to edge distances are calculated in the total system energy.
This cost function , besides detecting line intersection, is a
performance intensive component of this algorithm and best left
to optimization phase. <code>isFineTuning</code> is switched to
<code>true</code> if and when the <code>fineTuningRadius</code>
radius is reached. Switching this variable to <code>true</code>
before the algorithm runs mean the node to edge cost function
is always calculated.
<P>
<DL>
</DL>
</DL>
<!-- ========= CONSTRUCTOR DETAIL ======== -->
<A NAME="constructor_detail"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2">
<B>Constructor Detail</B></FONT></TH>
</TR>
</TABLE>
<A NAME="mxOrganicLayout(com.mxgraph.view.mxGraph)"><!-- --></A><H3>
mxOrganicLayout</H3>
<PRE>
public <B>mxOrganicLayout</B>(<A HREF="../../../com/mxgraph/view/mxGraph.html" title="class in com.mxgraph.view">mxGraph</A> graph)</PRE>
<DL>
<DD>Constructor for mxOrganicLayout.
<P>
</DL>
<HR>
<A NAME="mxOrganicLayout(com.mxgraph.view.mxGraph, java.awt.geom.Rectangle2D)"><!-- --></A><H3>
mxOrganicLayout</H3>
<PRE>
public <B>mxOrganicLayout</B>(<A HREF="../../../com/mxgraph/view/mxGraph.html" title="class in com.mxgraph.view">mxGraph</A> graph,
<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/awt/geom/Rectangle2D.html" title="class or interface in java.awt.geom">Rectangle2D</A> bounds)</PRE>
<DL>
<DD>Constructor for mxOrganicLayout.
<P>
</DL>
<!-- ============ METHOD DETAIL ========== -->
<A NAME="method_detail"><!-- --></A>
<TABLE BORDER="1" WIDTH="100%" CELLPADDING="3" CELLSPACING="0" SUMMARY="">
<TR BGCOLOR="#CCCCFF" CLASS="TableHeadingColor">
<TH ALIGN="left" COLSPAN="1"><FONT SIZE="+2">
<B>Method Detail</B></FONT></TH>
</TR>
</TABLE>
<A NAME="isVertexIgnored(java.lang.Object)"><!-- --></A><H3>
isVertexIgnored</H3>
<PRE>
public boolean <B>isVertexIgnored</B>(<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A> vertex)</PRE>
<DL>
<DD>Returns true if the given vertex has no connected edges.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="../../../com/mxgraph/layout/mxGraphLayout.html#isVertexIgnored(java.lang.Object)">isVertexIgnored</A></CODE> in class <CODE><A HREF="../../../com/mxgraph/layout/mxGraphLayout.html" title="class in com.mxgraph.layout">mxGraphLayout</A></CODE></DL>
</DD>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>vertex</CODE> - Object that represents the vertex to be tested.
<DT><B>Returns:</B><DD>Returns true if the vertex should be ignored.</DL>
</DD>
</DL>
<HR>
<A NAME="execute(java.lang.Object)"><!-- --></A><H3>
execute</H3>
<PRE>
public void <B>execute</B>(<A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A> parent)</PRE>
<DL>
<DD>Implements <mxGraphLayout.execute>.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>parent</CODE> - Parent cell that contains the children to be layed out.</DL>
</DD>
</DL>
<HR>
<A NAME="performRound()"><!-- --></A><H3>
performRound</H3>
<PRE>
protected void <B>performRound</B>()</PRE>
<DL>
<DD>The main round of the algorithm. Firstly, a permutation of nodes
is created and worked through in that random order. Then, for each node
a number of point of a circle of radius <code>moveRadius</code> are
selected and the total energy of the system calculated if that node
were moved to that new position. If a lower energy position is found
this is accepted and the algorithm moves onto the next node. There
may be a slightly lower energy value yet to be found, but forcing
the loop to check all possible positions adds nearly the current
processing time again, and for little benefit. Another possible
strategy would be to take account of the fact that the energy values
around the circle decrease for half the loop and increase for the
other, as a general rule. If part of the decrease were seen, then
when the energy of a node increased, the previous node position was
almost always the lowest energy position. This adds about two loop
iterations to the inner loop and only makes sense with 16 tries or more.
<P>
<DD><DL>
</DL>
</DD>
</DL>
<HR>
<A NAME="calcEnergyDelta(int, double, double, double, double, double, double)"><!-- --></A><H3>
calcEnergyDelta</H3>
<PRE>
protected double <B>calcEnergyDelta</B>(int index,
double oldNodeDistribution,
double oldEdgeDistance,
double oldEdgeCrossing,
double oldBorderLine,
double oldEdgeLength,
double oldAdditionalFactorsEnergy)</PRE>
<DL>
<DD>Calculates the change in energy for the specified node. The new energy is
calculated from the cost function methods and the old energy values for
each cost function are passed in as parameters
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>index</CODE> - The index of the node in the <code>vertices</code> array<DD><CODE>oldNodeDistribution</CODE> - The previous node distribution energy cost of this node<DD><CODE>oldEdgeDistance</CODE> - The previous edge distance energy cost of this node<DD><CODE>oldEdgeCrossing</CODE> - The previous edge crossing energy cost for edges connected to
this node<DD><CODE>oldBorderLine</CODE> - The previous border line energy cost for this node<DD><CODE>oldEdgeLength</CODE> - The previous edge length energy cost for edges connected to
this node<DD><CODE>oldAdditionalFactorsEnergy</CODE> - The previous energy cost for additional factors from
sub-classes
<DT><B>Returns:</B><DD>the delta of the new energy cost to the old energy cost</DL>
</DD>
</DL>
<HR>
<A NAME="getNodeDistribution(int)"><!-- --></A><H3>
getNodeDistribution</H3>
<PRE>
protected double <B>getNodeDistribution</B>(int i)</PRE>
<DL>
<DD>Calculates the energy cost of the specified node relative to all other
nodes. Basically produces a higher energy the closer nodes are together.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the node in the array <code>v</code>
<DT><B>Returns:</B><DD>the total node distribution energy of the specified node</DL>
</DD>
</DL>
<HR>
<A NAME="getBorderline(int)"><!-- --></A><H3>
getBorderline</H3>
<PRE>
protected double <B>getBorderline</B>(int i)</PRE>
<DL>
<DD>This method calculates the energy of the distance of the specified
node to the notional border of the graph. The energy increases up to
a limited maximum close to the border and stays at that maximum
up to and over the border.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the node in the array <code>v</code>
<DT><B>Returns:</B><DD>the total border line energy of the specified node</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeLengthAffectedEdges(int)"><!-- --></A><H3>
getEdgeLengthAffectedEdges</H3>
<PRE>
protected double <B>getEdgeLengthAffectedEdges</B>(int node)</PRE>
<DL>
<DD>Obtains the energy cost function for the specified node being moved.
This involves calling <code>getEdgeLength</code> for all
edges connected to the specified node
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>node</CODE> - the node whose connected edges cost functions are to be
calculated
<DT><B>Returns:</B><DD>the total edge length energy of the connected edges</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeLength(int)"><!-- --></A><H3>
getEdgeLength</H3>
<PRE>
protected double <B>getEdgeLength</B>(int i)</PRE>
<DL>
<DD>This method calculates the energy due to the length of the specified
edge. The energy is proportional to the length of the edge, making
shorter edges preferable in the layout.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the edge in the array <code>e</code>
<DT><B>Returns:</B><DD>the total edge length energy of the specified edge</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeCrossingAffectedEdges(int)"><!-- --></A><H3>
getEdgeCrossingAffectedEdges</H3>
<PRE>
protected double <B>getEdgeCrossingAffectedEdges</B>(int node)</PRE>
<DL>
<DD>Obtains the energy cost function for the specified node being moved.
This involves calling <code>getEdgeCrossing</code> for all
edges connected to the specified node
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>node</CODE> - the node whose connected edges cost functions are to be
calculated
<DT><B>Returns:</B><DD>the total edge crossing energy of the connected edges</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeCrossing(int)"><!-- --></A><H3>
getEdgeCrossing</H3>
<PRE>
protected double <B>getEdgeCrossing</B>(int i)</PRE>
<DL>
<DD>This method calculates the energy of the distance from the specified
edge crossing any other edges. Each crossing add a constant factor
to the total energy
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the edge in the array <code>e</code>
<DT><B>Returns:</B><DD>the total edge crossing energy of the specified edge</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeDistanceFromNode(int)"><!-- --></A><H3>
getEdgeDistanceFromNode</H3>
<PRE>
protected double <B>getEdgeDistanceFromNode</B>(int i)</PRE>
<DL>
<DD>This method calculates the energy of the distance between Cells and
Edges. This version of the edge distance cost calculates the energy
cost from a specified <strong>node</strong>. The distance cost to all
unconnected edges is calculated and the total returned.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the node in the array <code>v</code>
<DT><B>Returns:</B><DD>the total edge distance energy of the node</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeDistanceAffectedNodes(int)"><!-- --></A><H3>
getEdgeDistanceAffectedNodes</H3>
<PRE>
protected double <B>getEdgeDistanceAffectedNodes</B>(int node)</PRE>
<DL>
<DD>Obtains the energy cost function for the specified node being moved.
This involves calling <code>getEdgeDistanceFromEdge</code> for all
edges connected to the specified node
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>node</CODE> - the node whose connected edges cost functions are to be
calculated
<DT><B>Returns:</B><DD>the total edge distance energy of the connected edges</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeDistanceFromEdge(int)"><!-- --></A><H3>
getEdgeDistanceFromEdge</H3>
<PRE>
protected double <B>getEdgeDistanceFromEdge</B>(int i)</PRE>
<DL>
<DD>This method calculates the energy of the distance between Cells and
Edges. This version of the edge distance cost calculates the energy
cost from a specified <strong>edge</strong>. The distance cost to all
unconnected nodes is calculated and the total returned.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the index of the edge in the array <code>e</code>
<DT><B>Returns:</B><DD>the total edge distance energy of the edge</DL>
</DD>
</DL>
<HR>
<A NAME="getAdditionFactorsEnergy(int)"><!-- --></A><H3>
getAdditionFactorsEnergy</H3>
<PRE>
protected double <B>getAdditionFactorsEnergy</B>(int i)</PRE>
<DL>
<DD>Hook method to adding additional energy factors into the layout.
Calculates the energy just for the specified node.
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>i</CODE> - the nodes whose energy is being calculated
<DT><B>Returns:</B><DD>the energy of this node caused by the additional factors</DL>
</DD>
</DL>
<HR>
<A NAME="getRelevantEdges(int)"><!-- --></A><H3>
getRelevantEdges</H3>
<PRE>
protected int[] <B>getRelevantEdges</B>(int cellIndex)</PRE>
<DL>
<DD>Returns all Edges that are not connected to the specifed cell
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>cellIndex</CODE> - the cell index to which the edges are not connected
<DT><B>Returns:</B><DD>Array of all interesting Edges</DL>
</DD>
</DL>
<HR>
<A NAME="getConnectedEdges(int)"><!-- --></A><H3>
getConnectedEdges</H3>
<PRE>
protected int[] <B>getConnectedEdges</B>(int cellIndex)</PRE>
<DL>
<DD>Returns all Edges that are connected with the specified cell
<P>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>cellIndex</CODE> - the cell index to which the edges are connected
<DT><B>Returns:</B><DD>Array of all connected Edges</DL>
</DD>
</DL>
<HR>
<A NAME="toString()"><!-- --></A><H3>
toString</H3>
<PRE>
public <A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/String.html" title="class or interface in java.lang">String</A> <B>toString</B>()</PRE>
<DL>
<DD>Returns <code>Organic</code>, the name of this algorithm.
<P>
<DD><DL>
<DT><B>Overrides:</B><DD><CODE><A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html#toString()" title="class or interface in java.lang">toString</A></CODE> in class <CODE><A HREF="http://java.sun.com/j2se/1.5.0/docs/api/java/lang/Object.html" title="class or interface in java.lang">Object</A></CODE></DL>
</DD>
<DD><DL>
</DL>
</DD>
</DL>
<HR>
<A NAME="getAverageNodeArea()"><!-- --></A><H3>
getAverageNodeArea</H3>
<PRE>
public double <B>getAverageNodeArea</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the averageNodeArea.</DL>
</DD>
</DL>
<HR>
<A NAME="setAverageNodeArea(double)"><!-- --></A><H3>
setAverageNodeArea</H3>
<PRE>
public void <B>setAverageNodeArea</B>(double averageNodeArea)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>averageNodeArea</CODE> - The averageNodeArea to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getBorderLineCostFactor()"><!-- --></A><H3>
getBorderLineCostFactor</H3>
<PRE>
public double <B>getBorderLineCostFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the borderLineCostFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setBorderLineCostFactor(double)"><!-- --></A><H3>
setBorderLineCostFactor</H3>
<PRE>
public void <B>setBorderLineCostFactor</B>(double borderLineCostFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>borderLineCostFactor</CODE> - The borderLineCostFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeCrossingCostFactor()"><!-- --></A><H3>
getEdgeCrossingCostFactor</H3>
<PRE>
public double <B>getEdgeCrossingCostFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the edgeCrossingCostFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setEdgeCrossingCostFactor(double)"><!-- --></A><H3>
setEdgeCrossingCostFactor</H3>
<PRE>
public void <B>setEdgeCrossingCostFactor</B>(double edgeCrossingCostFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>edgeCrossingCostFactor</CODE> - The edgeCrossingCostFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeDistanceCostFactor()"><!-- --></A><H3>
getEdgeDistanceCostFactor</H3>
<PRE>
public double <B>getEdgeDistanceCostFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the edgeDistanceCostFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setEdgeDistanceCostFactor(double)"><!-- --></A><H3>
setEdgeDistanceCostFactor</H3>
<PRE>
public void <B>setEdgeDistanceCostFactor</B>(double edgeDistanceCostFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>edgeDistanceCostFactor</CODE> - The edgeDistanceCostFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getEdgeLengthCostFactor()"><!-- --></A><H3>
getEdgeLengthCostFactor</H3>
<PRE>
public double <B>getEdgeLengthCostFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the edgeLengthCostFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setEdgeLengthCostFactor(double)"><!-- --></A><H3>
setEdgeLengthCostFactor</H3>
<PRE>
public void <B>setEdgeLengthCostFactor</B>(double edgeLengthCostFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>edgeLengthCostFactor</CODE> - The edgeLengthCostFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getFineTuningRadius()"><!-- --></A><H3>
getFineTuningRadius</H3>
<PRE>
public double <B>getFineTuningRadius</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the fineTuningRadius.</DL>
</DD>
</DL>
<HR>
<A NAME="setFineTuningRadius(double)"><!-- --></A><H3>
setFineTuningRadius</H3>
<PRE>
public void <B>setFineTuningRadius</B>(double fineTuningRadius)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>fineTuningRadius</CODE> - The fineTuningRadius to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getInitialMoveRadius()"><!-- --></A><H3>
getInitialMoveRadius</H3>
<PRE>
public double <B>getInitialMoveRadius</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the initialMoveRadius.</DL>
</DD>
</DL>
<HR>
<A NAME="setInitialMoveRadius(double)"><!-- --></A><H3>
setInitialMoveRadius</H3>
<PRE>
public void <B>setInitialMoveRadius</B>(double initialMoveRadius)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>initialMoveRadius</CODE> - The initialMoveRadius to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isFineTuning()"><!-- --></A><H3>
isFineTuning</H3>
<PRE>
public boolean <B>isFineTuning</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isFineTuning.</DL>
</DD>
</DL>
<HR>
<A NAME="setFineTuning(boolean)"><!-- --></A><H3>
setFineTuning</H3>
<PRE>
public void <B>setFineTuning</B>(boolean isFineTuning)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isFineTuning</CODE> - The isFineTuning to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isOptimizeBorderLine()"><!-- --></A><H3>
isOptimizeBorderLine</H3>
<PRE>
public boolean <B>isOptimizeBorderLine</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isOptimizeBorderLine.</DL>
</DD>
</DL>
<HR>
<A NAME="setOptimizeBorderLine(boolean)"><!-- --></A><H3>
setOptimizeBorderLine</H3>
<PRE>
public void <B>setOptimizeBorderLine</B>(boolean isOptimizeBorderLine)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isOptimizeBorderLine</CODE> - The isOptimizeBorderLine to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isOptimizeEdgeCrossing()"><!-- --></A><H3>
isOptimizeEdgeCrossing</H3>
<PRE>
public boolean <B>isOptimizeEdgeCrossing</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isOptimizeEdgeCrossing.</DL>
</DD>
</DL>
<HR>
<A NAME="setOptimizeEdgeCrossing(boolean)"><!-- --></A><H3>
setOptimizeEdgeCrossing</H3>
<PRE>
public void <B>setOptimizeEdgeCrossing</B>(boolean isOptimizeEdgeCrossing)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isOptimizeEdgeCrossing</CODE> - The isOptimizeEdgeCrossing to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isOptimizeEdgeDistance()"><!-- --></A><H3>
isOptimizeEdgeDistance</H3>
<PRE>
public boolean <B>isOptimizeEdgeDistance</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isOptimizeEdgeDistance.</DL>
</DD>
</DL>
<HR>
<A NAME="setOptimizeEdgeDistance(boolean)"><!-- --></A><H3>
setOptimizeEdgeDistance</H3>
<PRE>
public void <B>setOptimizeEdgeDistance</B>(boolean isOptimizeEdgeDistance)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isOptimizeEdgeDistance</CODE> - The isOptimizeEdgeDistance to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isOptimizeEdgeLength()"><!-- --></A><H3>
isOptimizeEdgeLength</H3>
<PRE>
public boolean <B>isOptimizeEdgeLength</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isOptimizeEdgeLength.</DL>
</DD>
</DL>
<HR>
<A NAME="setOptimizeEdgeLength(boolean)"><!-- --></A><H3>
setOptimizeEdgeLength</H3>
<PRE>
public void <B>setOptimizeEdgeLength</B>(boolean isOptimizeEdgeLength)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isOptimizeEdgeLength</CODE> - The isOptimizeEdgeLength to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isOptimizeNodeDistribution()"><!-- --></A><H3>
isOptimizeNodeDistribution</H3>
<PRE>
public boolean <B>isOptimizeNodeDistribution</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the isOptimizeNodeDistribution.</DL>
</DD>
</DL>
<HR>
<A NAME="setOptimizeNodeDistribution(boolean)"><!-- --></A><H3>
setOptimizeNodeDistribution</H3>
<PRE>
public void <B>setOptimizeNodeDistribution</B>(boolean isOptimizeNodeDistribution)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>isOptimizeNodeDistribution</CODE> - The isOptimizeNodeDistribution to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getMaxIterations()"><!-- --></A><H3>
getMaxIterations</H3>
<PRE>
public int <B>getMaxIterations</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the maxIterations.</DL>
</DD>
</DL>
<HR>
<A NAME="setMaxIterations(int)"><!-- --></A><H3>
setMaxIterations</H3>
<PRE>
public void <B>setMaxIterations</B>(int maxIterations)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>maxIterations</CODE> - The maxIterations to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getMinDistanceLimit()"><!-- --></A><H3>
getMinDistanceLimit</H3>
<PRE>
public double <B>getMinDistanceLimit</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the minDistanceLimit.</DL>
</DD>
</DL>
<HR>
<A NAME="setMinDistanceLimit(double)"><!-- --></A><H3>
setMinDistanceLimit</H3>
<PRE>
public void <B>setMinDistanceLimit</B>(double minDistanceLimit)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>minDistanceLimit</CODE> - The minDistanceLimit to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getMinMoveRadius()"><!-- --></A><H3>
getMinMoveRadius</H3>
<PRE>
public double <B>getMinMoveRadius</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the minMoveRadius.</DL>
</DD>
</DL>
<HR>
<A NAME="setMinMoveRadius(double)"><!-- --></A><H3>
setMinMoveRadius</H3>
<PRE>
public void <B>setMinMoveRadius</B>(double minMoveRadius)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>minMoveRadius</CODE> - The minMoveRadius to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getNodeDistributionCostFactor()"><!-- --></A><H3>
getNodeDistributionCostFactor</H3>
<PRE>
public double <B>getNodeDistributionCostFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the nodeDistributionCostFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setNodeDistributionCostFactor(double)"><!-- --></A><H3>
setNodeDistributionCostFactor</H3>
<PRE>
public void <B>setNodeDistributionCostFactor</B>(double nodeDistributionCostFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>nodeDistributionCostFactor</CODE> - The nodeDistributionCostFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getRadiusScaleFactor()"><!-- --></A><H3>
getRadiusScaleFactor</H3>
<PRE>
public double <B>getRadiusScaleFactor</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the radiusScaleFactor.</DL>
</DD>
</DL>
<HR>
<A NAME="setRadiusScaleFactor(double)"><!-- --></A><H3>
setRadiusScaleFactor</H3>
<PRE>
public void <B>setRadiusScaleFactor</B>(double radiusScaleFactor)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>radiusScaleFactor</CODE> - The radiusScaleFactor to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getTriesPerCell()"><!-- --></A><H3>
getTriesPerCell</H3>
<PRE>
public int <B>getTriesPerCell</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the triesPerCell.</DL>
</DD>
</DL>
<HR>
<A NAME="setTriesPerCell(int)"><!-- --></A><H3>
setTriesPerCell</H3>
<PRE>
public void <B>setTriesPerCell</B>(int triesPerCell)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>triesPerCell</CODE> - The triesPerCell to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getUnchangedEnergyRoundTermination()"><!-- --></A><H3>
getUnchangedEnergyRoundTermination</H3>
<PRE>
public int <B>getUnchangedEnergyRoundTermination</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the unchangedEnergyRoundTermination.</DL>
</DD>
</DL>
<HR>
<A NAME="setUnchangedEnergyRoundTermination(int)"><!-- --></A><H3>
setUnchangedEnergyRoundTermination</H3>
<PRE>
public void <B>setUnchangedEnergyRoundTermination</B>(int unchangedEnergyRoundTermination)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>unchangedEnergyRoundTermination</CODE> - The unchangedEnergyRoundTermination to set.</DL>
</DD>
</DL>
<HR>
<A NAME="getMaxDistanceLimit()"><!-- --></A><H3>
getMaxDistanceLimit</H3>
<PRE>
public double <B>getMaxDistanceLimit</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>Returns the maxDistanceLimit.</DL>
</DD>
</DL>
<HR>
<A NAME="setMaxDistanceLimit(double)"><!-- --></A><H3>
setMaxDistanceLimit</H3>
<PRE>
public void <B>setMaxDistanceLimit</B>(double maxDistanceLimit)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>maxDistanceLimit</CODE> - The maxDistanceLimit to set.</DL>
</DD>
</DL>
<HR>
<A NAME="isApproxNodeDimensions()"><!-- --></A><H3>
isApproxNodeDimensions</H3>
<PRE>
public boolean <B>isApproxNodeDimensions</B>()</PRE>
<DL>
<DD><DL>
<DT><B>Returns:</B><DD>the approxNodeDimensions</DL>
</DD>
</DL>
<HR>
<A NAME="setApproxNodeDimensions(boolean)"><!-- --></A><H3>
setApproxNodeDimensions</H3>
<PRE>
public void <B>setApproxNodeDimensions</B>(boolean approxNodeDimensions)</PRE>
<DL>
<DD><DL>
<DT><B>Parameters:</B><DD><CODE>approxNodeDimensions</CODE> - the approxNodeDimensions to set</DL>
</DD>
</DL>
<!-- ========= END OF CLASS DATA ========= -->
<HR>
<!-- ======= START OF BOTTOM NAVBAR ====== -->
<A NAME="navbar_bottom"><!-- --></A>
<A HREF="#skip-navbar_bottom" title="Skip navigation links"></A>
<TABLE BORDER="0" WIDTH="100%" CELLPADDING="1" CELLSPACING="0" SUMMARY="">
<TR>
<TD COLSPAN=2 BGCOLOR="#EEEEFF" CLASS="NavBarCell1">
<A NAME="navbar_bottom_firstrow"><!-- --></A>
<TABLE BORDER="0" CELLPADDING="0" CELLSPACING="3" SUMMARY="">
<TR ALIGN="center" VALIGN="top">
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../overview-summary.html"><FONT CLASS="NavBarFont1"><B>Overview</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-summary.html"><FONT CLASS="NavBarFont1"><B>Package</B></FONT></A> </TD>
<TD BGCOLOR="#FFFFFF" CLASS="NavBarCell1Rev"> <FONT CLASS="NavBarFont1Rev"><B>Class</B></FONT> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="class-use/mxOrganicLayout.html"><FONT CLASS="NavBarFont1"><B>Use</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="package-tree.html"><FONT CLASS="NavBarFont1"><B>Tree</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../deprecated-list.html"><FONT CLASS="NavBarFont1"><B>Deprecated</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../index-all.html"><FONT CLASS="NavBarFont1"><B>Index</B></FONT></A> </TD>
<TD BGCOLOR="#EEEEFF" CLASS="NavBarCell1"> <A HREF="../../../help-doc.html"><FONT CLASS="NavBarFont1"><B>Help</B></FONT></A> </TD>
</TR>
</TABLE>
</TD>
<TD ALIGN="right" VALIGN="top" ROWSPAN=3><EM>
<p><b>JGraph X 1.2.0.8</b></p></EM>
</TD>
</TR>
<TR>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../com/mxgraph/layout/mxIGraphLayout.html" title="interface in com.mxgraph.layout"><B>PREV CLASS</B></A>
<A HREF="../../../com/mxgraph/layout/mxOrganicLayout.CellWrapper.html" title="class in com.mxgraph.layout"><B>NEXT CLASS</B></A></FONT></TD>
<TD BGCOLOR="white" CLASS="NavBarCell2"><FONT SIZE="-2">
<A HREF="../../../index.html?com/mxgraph/layout/mxOrganicLayout.html" target="_top"><B>FRAMES</B></A>
<A HREF="mxOrganicLayout.html" target="_top"><B>NO FRAMES</B></A>
<SCRIPT type="text/javascript">
<!--
if(window==top) {
document.writeln('<A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A>');
}
//-->
</SCRIPT>
<NOSCRIPT>
<A HREF="../../../allclasses-noframe.html"><B>All Classes</B></A>
</NOSCRIPT>
</FONT></TD>
</TR>
<TR>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
SUMMARY: <A HREF="#nested_class_summary">NESTED</A> | <A HREF="#field_summary">FIELD</A> | <A HREF="#constructor_summary">CONSTR</A> | <A HREF="#method_summary">METHOD</A></FONT></TD>
<TD VALIGN="top" CLASS="NavBarCell3"><FONT SIZE="-2">
DETAIL: <A HREF="#field_detail">FIELD</A> | <A HREF="#constructor_detail">CONSTR</A> | <A HREF="#method_detail">METHOD</A></FONT></TD>
</TR>
</TABLE>
<A NAME="skip-navbar_bottom"></A>
<!-- ======== END OF BOTTOM NAVBAR ======= -->
<HR>
<font size=1>Copyright (c) 2008 <a href="http://www.mxgraph.com/"
target="_blank">Gaudenz Alder</a>. All rights reserved.</font>
</BODY>
</HTML>
|
