|
|
|
|
|
|
 |
 |
|
Anneal: A Simulated Annealing Algorithm for Combinatorica Graphs in Mathematica
|
|
|
|
|
|
| Organization: | University of California, Irvine |
|
|
|
|
|
|
0205-030
|
|
|
|
|
|
1995-01-17
|
|
|
|
|
|
This package includes a single procedure, Anneal, which minimizes the total length of all edges in a graph, and returns a new graph. The locations of all the points are the same, just reordered to minimize the total length of the edges connecting them.
|
|
|
|
|
|
|
|
|
|
|
|
Simulated annealing, graph embedding, graphs, embedding, edge length, minimizing edge lengths, Combinatorica
|
|
|
 |
|
|
| Anneal-41.m (7.6 KB) - Mathematica Package [for Mathematica 4.1] | | Anneal.m (7.9 KB) - Mathematica Package [for Mathematica 4.2] |
|
|
|
|
|
|
|
| | | | | |
|
For the newest resources, visit Wolfram Repositories and Archives »
