We are using your software since several years and we are really happy with it.

We would request a new feature or try to implement it ourself.

We draw a lot of links between nodes and use your flow chart similar to Matlab Simulink. When links cross each other we use the "cut links" to show that the links are not connected. But now we need the possibility to draw a round dot on branches where two links from the same source are splitting, or two links with the same destination are joining. We think, that you might have an easy possibility to do that because you already distinguish between overlapping lines an crossing lines in your "cut links" algorithm. May be it's easy for you to add this feature. I think a lot of your customers will appreciate ist. It makes data flow diagrams much more readable.

The second question is if you have an suggestion how to implement a routing were lines from the same source or with the same destination routed as long as possible above each other while all other lines are routed normally.

We also thought already about your ternary sample, but this is not the right solution for us, because we need links between nodes without any additionally help nodes.

best regards

* that code assumes 'cascading' links and does not check if segments lie on same line apart from comparing first points. If you need same feature for polylines at arbitrary angles, you will also have to check for collinearity.

Right, we hadn't considered branching could happen further along the link path and code above was handling only first segments. This should look for common points in next segments too -

int LastCommonPoint(DiagramLink l1, DiagramLink l2)
{
	int cpi = 1;
	while (
		l1.ControlPoints[cpi] == l2.ControlPoints[cpi] &&
		cpi < l1.ControlPoints.Count - 1 &&
		cpi < l2.ControlPoints.Count - 1)
	{
		cpi++;
	}
	return cpi - 1;
}

void diagram_DrawLink(object sender, DrawLinkEventArgs e)
{
	if (e.Shadow)
		return;
	var node = e.Link.Origin;
	var links = new List<DiagramLink>();

	foreach (var link in node.OutgoingLinks)
	{
		if (link.StartPoint == e.Link.StartPoint)
			links.Add(link);
	}

	if (links.Count < 2)
		return;

	links.Sort((l1, l2) =>
	{
		return l1.Length.CompareTo(l2.Length);
	});

	var longest = links[links.Count - 1];
	if (e.Link != longest)
	{
		int cpi = LastCommonPoint(e.Link, longest);
		var cp1 = e.Link.ControlPoints;
		var cp2 = longest.ControlPoints;
		if (cpi < cp1.Count - 1)
		{
			var dx1 = cp1[cpi + 1].X - cp1[cpi].X;
			var dy1 = cp1[cpi + 1].Y - cp1[cpi].Y;
			var dx2 = cp2[cpi + 1].X - cp2[cpi].X;
			var dy2 = cp2[cpi + 1].Y - cp2[cpi].Y;
			var ec = Math.Sign(dx1) == Math.Sign(dx2) && Math.Sign(dy1) == Math.Sign(dy2) ?
				cp1[cpi + 1] : cp1[cpi];
			using (var elipseBrush = new System.Drawing.SolidBrush(Color.Red))
			{
				e.Graphics.FillEllipse(
					elipseBrush, ec.X - 2, ec.Y - 2, 4, 4);
			}
		}
	}
} 

I guess we could add some post-processing step for routing algorithm that pulls together segments of links from same origin. We'll need to think of some criteria for whether such link go in same general direction to do that.

From reply above Quote:


you could implement it as post-routing step of some kind too if you can think of good way to determine for how long links should overlap. I guess it could be based on distance of segments from each other after routing - set first elements of ControlPoints to same coordinates until the initial routes diverge too far by some threshold value.

Yes, we'll have in mind both branching indication and merged routes for link with same StartPoint for next release.

In 2-3 months; we might have a preview / beta build earlier.

Try the LinkBranchIndicator, BranchIndicatorSize and BranchIndicatorColor properties here -
https://mindfusion.eu/_beta/fcnet_branchind.zip

These work only for Cascading link shape. Setting diagram.LinkBranchIndicator to BranchIndicator.Arrow looks like this -

Hi,

It actually only looks for branch points where links diverge, not junction ones where they merge. We'll add separate properties for junctions in a few days.

Regards,
Slavcho