Mathematica 9 is now available

Wolfram Library Archive


All Collections Articles Books Conference Proceedings
Courseware Demos MathSource Technical Notes
Title Downloads

Anneal: A Simulated Annealing Algorithm for Combinatorica Graphs in Mathematica
Author

Jeffrey A. Stern
Organization: University of California, Irvine
Old MathSource #

0205-030
Revision date

1995-01-17
Description

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.
Subjects

*Applied Mathematics > Optimization
*Mathematics > Discrete Mathematics > Graph Theory
Keywords

Simulated annealing, graph embedding, graphs, embedding, edge length, minimizing edge lengths, Combinatorica
Downloads Download Wolfram CDF Player

Download
Anneal-41.m (7.6 KB) - Mathematica Package [for Mathematica 4.1]
Download
Anneal.m (7.9 KB) - Mathematica Package [for Mathematica 4.2]