WOLFRAM|DEMONSTRATIONS PROJECT

Graph Embedding Trajectories

​
graph index
1
2
3
4
5
6
7
8
9
10
show what
trajectories
GraphPlot
maximum iterations
20
vertex labeling
Automatic
True
False
Tooltip
All
edge rendering function
Automatic
None
trajectory rendering method
constant
variable
trajectory opacity
0.8
expert mode
method
SpringElectrical
Spring
energy control
Automatic
Monotonic
NonMonotonic
inferential distance
1
repulsive force power
-1.4
random seed
1
recursion method
Automatic
Multilevel
None
special controls when recursion method is "Multilevel"
randomization
Automatic
True
False
minimum size
Automatic
coarsening scheme
MaximalIndependentVertexSet
step control
Automatic
Monotonic
NonMonotonic
StrictlyMonotonic
The computation of vertex coordinates for the display of a graph often proceeds through an iterative algorithm. This Demonstration shows this iterative process in two ways for 11 different random graphs. By selecting "show what" to be trajectories, you see a graphic in which the trajectory of each vertex appears as a colored line with a point at the end; each vertex has its own signature color. A second set of controls lets you control aspects of the visualization of either the GraphPlot or the trajectories. In the case of a GraphPlot, you control how the vertices are labeled and whether the edges are shown. In the case of trajectories, you control the opacity of the lines. A third set of "expert mode" controls enables advanced modifications of the iterative process using many of the options of the GraphPlot command.