9464

Graph Embedding Trajectories

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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

Snapshot 1: trajectories of graph 4 with a spring electrical embedding and trajectories drawn with variable color and thickness
Snapshot 2: trajectories of graph 4 with a spring embedding and trajectories drawn with variable color and thickness
Snapshot 3: trajectories of graph 4 with a spring electrical embedding and trajectories drawn with variable color and thickness but induced by a higher absolute repulsive force power
Snapshot 4: a GraphPlot of the iteration of graph 8
Snapshot 5: a GraphPlot of the iteration of graph 8
Snapshot 6: a GraphPlot of the iteration of graph 8 with a different starting random seed
Snapshot 7: trajectories of graph 3 with a spring electrical embedding using "Multilevel" recursion and the "MaximalIndependentEdgeSet" coarsening scheme
Snapshot 8: trajectories of graph 3 with a spring electrical embedding using "Multilevel" recursion and "MaximalIndependentVertexRugeStuben" coarsening scheme
Snapshot 9: trajectories of graph 3 with a spring electrical embedding using "Multilevel" recursion and "StrictlyMonotonic" step control
The "variable" method of trajectory rendering partitions each trajectory and applies different graphic directives to each segment of the trajectory. Later "moves" within the trajectory are thicker and darker.
Information on the expert controls may be found in the "General Graph Drawing" tutorial in the standard Mathematica documentation.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.









 
RELATED RESOURCES
Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Powered by Wolfram Mathematica © 2014 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+