by Lassalle Technologies - Product Type: Component / .NET WinForms / .NET Class / 100% Managed Code
Create interactive flowcharts and workflow diagrams and include a set of graph drawing algorithms. AddFlow Suite for .NET includes AddFlow for .NET and LayoutFlow for .NET that is a collection of 5 layout components to enable you to automatically display graphs or flow charts following some aesthetic rules. Includes: HFlow (hierarchical layout), OFlow (orthogonal layout), SFlow (symmetric force directed layout), SPFlow (Series Parallel),TFlow (tree or radial layout). These controls are AddFlow for .NET extensions. Each of these controls allows performing a graph layout automatically, positioning its vertices (also called nodes) and edges (also called links) on a form containing an AddFlow control. Visual Studio 2005 (VS2005, VS 2005) and Visual Studio .NET 2008 compatible. Royalty free redistribution and many samples included for Visual Basic .NET (VB.NET) and C#.
Our regular prices are shown below. Please logon to see your discounted prices.
| Add to Cart | $ 685.02 | 1 Developer License | Download (10.9 MB) | |
| Add to Cart | $ 1,469.02 | 4 Developer Team License | Download (10.9 MB) | |
| Add to Cart | $ 4,605.02 | 1 Site Wide License (Allows Unlimited Developers at a Single Physical Address) | Download (10.9 MB) | |
| Add to Cart | $ 195.02 | 1 Developer Upgrade License from AddFlow Suite for.NET V1.x Developer License | Verify | Download (10.9 MB) |
| Add to Cart | $ 391.02 | 4 Developer Team Upgrade License from AddFlow Suite for .NET V1.x Team License | Verify | Download (10.9 MB) |
| Add to Cart | $ 1,175.02 | 1 Site Wide Upgrade License from AddFlow Suite for .Net V1.x Site License | Verify | Download (10.9 MB) |
| Add to Cart | $ 489.02 | 1 Developer License | Verify | Download (10.9 MB) |
Our prices include ComponentSource technical support and, for most downloadable products, an online backup and a FREE upgrade to the new version if it is released within 30 days of your purchase. All sales are made on our standard Terms and Conditions and subject to our Return Policy. Please contact us if you require any licensing option not listed above including volume licensing and previous versions.
Our regular prices are shown above. Please logon to see your discounted prices.
What’s New in AddFlow for .NET V2.2?
What’s New in AddFlow for .NET V2.1?
Enhancements
Substantial improvements have been introduced in the AddFlow for .NET serialization feature:
Additionally, the SendSelectionChangeEventproperty is introduced. (If it is false, the SelectionChange event is not fired
What’s New in AddFlow for .NET V2.1?
AddFlow Suite for .NET includes both AddFlow for .NET and LayoutFlow for .NET
Following is a list of the main AddFlow for .NET and LayoutFlow for .NET features
AddFlow for .NET
General
Input/Output
Nodes
Links
Automatic graph layout
AddFlow does not directly provide any automatic graph layout feature. However LayoutFlow, a set of 4 Graph layout components that can be added on:
Notices:
HFlow (hierarchical layout), OFlow (orthogonal layout), SFlow (symmetric force directed layout), SPFlow (Series Parallel),TFlow (tree or radial layout) are AddFlow extensions and you cannot use them without AddFlow.
You can purchase LayoutFlow separately or included in the AddFlow Suite license
LayoutFlow for .NET
LayoutFlow for .NET is a set of five graph layout .NET components:
1) HFlow
The HFlow layout algorithm arranges vertices in horizontal layers. The orders of the vertices are chosen so that the number of crossings is kept small. HFlow just produces a reasonable solution, not the optimum solution.
2) 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.
3) 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). Using the animation mode you can see how SFlow is working.
5) SPFlow
The SPFlow layout algorithm allows performing a series-parallel layout on a graph. The SP layout applies only to a specific subset of graphs: series-parallel digraph (more precisely, a set of series-parallel diagraphs). A series-parallel digraph is defined recursively as follows.
A digraph consisting of two nodes, a source s and a sink t joined by a single link is a series-parallel digraph.
If G1 and G2 are series-parallel digraphs, so are the digraphs constructed by each of the following operations:
- the parallel composition: identify the source of G1 with the source of G2 and the sink of G1 with the sink of G2.
- the series composition: identify the sink of G1 with the source of G2.
We use an algorithm that allows drawing series-parallel digraphs with as much symmetry as possible.
5) TFlow
The TFlow layout algorithm 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. The drawing of the tree occupies as little space as possible while satisfying certain aesthetics.
If the DrawingStyle property is "Layered":
If the DrawingStyle property is "Radial":
Publisher
Primary Category
Related Products
Related Categories