-
Class Summary Class Description IlvGraphLayout The base class of the Graph Layout algorithms.
Package ilog.views.graphlayout Description
Many types of complex business data can be best visualized as a set of nodes and interconnecting links, more commonly called a graph. Examples of graphs include business organizational charts, systems management drawings, telecom network displays, and genealogical trees. Whenever these graphs become large or heavily interconnected, it becomes difficult to see the relationships between the various nodes and links.
This is where JViews' Graph Layout algorithms help. They allow you to take a "messy" graph and apply a sophisticated graph layout algorithm to it, to rearrange the positions of the nodes and/or the shape of the links. The result is a more readable, more understandable, and more meaningful data presentation.
According to the type of graph and your specific needs, you can choose one of the ready-to-use layout algorithms provided in JViews, or create your own one and still benefit from the general layout framework.
The table below helps you for choosing the best suited ready-to-use layout algorithm. For details, see the Graph Layout User's Manual.
Click on the image to see the original size.
| Domain-Independent Graphs | Telecom-Oriented Representations | ||||
|---|---|---|---|---|---|
| Trees | Cyclic Graphs | Combination of Cycles and Trees | Any | Bus | Ring and Star |
Tree Layout |
Topological Mesh Layout |
Spring Embedder |
Link Layout |
Bus Layout |
Circular Layout |
- Since:
- JViews 2.0
- See Also:
IlvGrapher,ilog.views.graphlayout.hierarchical,ilog.views.graphlayout.tree,ilog.views.graphlayout.uniformlengthedges,ilog.views.graphlayout.springembedder,ilog.views.graphlayout.topologicalmesh,ilog.views.graphlayout.link,ilog.views.graphlayout.bus,ilog.views.graphlayout.circular,ilog.views.graphlayout.grid,ilog.views.graphlayout.random