This paper presents a heuristic method for graph drawing developed by Peter Eades from the University of Queensland. The method aims to produce aesthetically pleasing layouts for graphs with fewer than 30 vertices, focusing on maintaining consistent edge lengths and displaying as much symmetry as possible. The core idea involves treating the graph as a mechanical system where vertices are steel rings and edges are springs. The system is simulated to reach a minimal energy state, resulting in a stable vertex placement. The algorithm uses logarithmic springs and inverse square law forces to achieve these goals. The method is particularly effective for regular grid structures, trees, and sparse graphs but struggles with dense graphs, graphs with a small number of bridges, and graphs with complex structures. The paper includes examples demonstrating the method's successes and limitations, and concludes that the heuristic is promising for practical graph layout problems, especially when combined with a graph editor for fine-tuning.This paper presents a heuristic method for graph drawing developed by Peter Eades from the University of Queensland. The method aims to produce aesthetically pleasing layouts for graphs with fewer than 30 vertices, focusing on maintaining consistent edge lengths and displaying as much symmetry as possible. The core idea involves treating the graph as a mechanical system where vertices are steel rings and edges are springs. The system is simulated to reach a minimal energy state, resulting in a stable vertex placement. The algorithm uses logarithmic springs and inverse square law forces to achieve these goals. The method is particularly effective for regular grid structures, trees, and sparse graphs but struggles with dense graphs, graphs with a small number of bridges, and graphs with complex structures. The paper includes examples demonstrating the method's successes and limitations, and concludes that the heuristic is promising for practical graph layout problems, especially when combined with a graph editor for fine-tuning.