public class LinLogLayout
LinLogLayout is a simple program for computing graph layouts
(positions of the nodes of a graph in two- or three-dimensional space)
and graph clusterings for visualization and knowledge discovery.
It reads a graph from a file, computes a layout and a clustering, writes
the layout and the clustering to a file, and displays them in a dialog.
LinLogLayout can be used to identify groups of densely connected nodes
in graphs, like groups of friends or collaborators in social networks,
related documents in hyperlink structures (e.g. web graphs),
cohesive subsystems in software models, etc.
With a change of a parameter in the main method,
it can also compute classical "nice" (i.e. readable) force-directed layouts.
The program is primarily intended as a demo for the use of its core layouter
and clusterer classes MinimizerBarnesHut,
MinimizerClassic, and OptimizerModularity.
While MinimizerBarnesHut is faster, MinimizerClassic
is simpler and not limited to a maximum of three dimensions.