Menu
Your Cart

LayoutFlow

LayoutFlow

Need more information on this product?

Please contact us on +44 (0)20 8733 7100 or via our online form.

Contact Us

If you are not currently a customer, you can apply for an account.

Register here


  • SKU: LAYOUTFLOW


Display graphs or flow charts in a reasonable manner
LayoutFlow is a set of four graph autolayout controls that perform autolayout graph drawing and therefore automatically auto-arrange the graph. A ActiveX version and a .NET version of each layout component is available.
  • HFlow HFlow allows performing a hierarchical layout on a graph. Vertices are arranged in horizontal layers. The orders of the vertices on the layers are chosen so that the number of crossings is kept as small as possible.

  • SFlow SFlow allows performing a symmetric layout on a graph. The symmetric layout produces a high degree of symmetry and is particularly useful for undirected graphs, where the directions of the edge are not important.

  • TFlow TFlow allows performing a tree layout on a graph. The tree layout applies only to a specific subset of graphs: rooted trees. In such a graph, no vertice may have more than one parent.

  • OFlow OFlow allows performing an orthogonal layout on a graph.

LayoutFlow - Features

The primary purpose of LayoutFlow is to offer a way to automatically display graphs or flow charts in a reasonable manner, following some aesthetic rules. Available is a ActiveX version and a .NET version of 4 Graph layout components.
  • HFlow HFlow allows performing a hierarchical layout on a graph. Vertices are arranged in horizontal layers. The orders of the vertices on the layers are chosen so that the number of crossings is kept as small as possible.

  • SFlow SFlow allows performing a symmetric layout on a graph. The symmetric layout produces a high degree of symmetry and is particularly useful for undirected graphs, where the directions of the edge are not important.

  • TFlow TFlow allows performing a tree layout on a graph. The tree layout applies only to a specific subset of graphs: rooted trees. In such a graph, no vertice may have more than one parent.

  • OFlow OFlow allows performing an orthogonal layout on a graph.