Click for more Click for more Feature Rich
Features such as distinct colours, fonts, shapes, styles, pictures, text, and so on for each object of the diagram (node or link) are available.
Click for more Build a graph interactively or programmatically
AddFlow allows building a graph interactively (you can create a full diagram without any programmation, with your mouse) and programmatically (it offers a set of OLE automation objects, properties and methods allowing for instance to create a node at a given position)
Click for more Build a graph interactively or programmatically
AddFlow allows building a graph interactively (you can create a full diagram without any coding, with your mouse) and programmatically (it offers a set of OLE automation objects, properties and methods allowing for instance to create a node at a given position)
Click for more LayoutFlow
AddFlow Suite includes both AddFlow and LayoutFlow, a collection of 4 layout components: HFlow (hierarchical layout), SFlow (symmetric layout), TFlow (tree layout) and OFlow (orthogonal layout). HFlow layout algorithm arranges vertices in horizontal layers. The orders of the vertices are chosen so that the number of crossings is kept small.
Click for more OFlow
The OFlow layout algorithm allows performing an orthogonal layout on a graph. The layout is orthogonal since it produces an orthogonal drawing where each edge is drawn as a polygonal chain of alternating horizontal and vertical segments. OFlow works with any graphs, connected or not. In the resulting drawing, if the graph is a graph of maximum degree four, then each node has the same size. If the degree of a node is higher than four, then the height of the node is expanded.
Click for more SFlow
The SFlow layout algorithm 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. The resulting layout is often good. However it requires considerable computational resources and therefore should be used for small graphs (less than 300 nodes).