 |
Graphs are often used to encapsulate the relationship between objects. Graph drawing enables visualization of such relationships. The usefulness of this visual representation is dependent on whether the drawing is aesthetic. While there are no strict criteria for aesthetics of a drawing, it is generally agreed, for example, that such a drawing has minimal edge crossing, with vertices evenly distributed in the space, and with symmetry that may exist in the graph depicted. A graph drawing algorithm for an undirected graph that is both efficient and of high quality was available in Mathematica 5.1, in the DiscreteMath`GraphPlot package. However in many applications, such as in drawing flow charts, organization charts, and so on, often it is necessary to have a sense of overall direction in the drawing. In this talk we present new algorithms in the GraphPlot package that enable drawings of such directed graphs.
|
|
For the newest resources, visit Wolfram Repositories and Archives »
