A OnmsTopology is a set of Vertices and Edges, a Map is a displayable OnmsTopology.
This means that a Topology can be represented in different way. 

For example a tree node connected topology can be represented:

N1-N0-N2 (let me say flat) or hierarchical:

    N0
 /         \

N1      N2

This very simple example will tell you a lot about the problems of represent a topology.

We support several algorithm:
Circle, D3, FR, Grid, Hierarchy, ISOM, KK, RealUltimate, Spring, TopoFR.

We need to study and set up new algorithms related especilly for linkd topology map.

We will support new maps and every should have a preferred layout algorithm that fit the map.