This issue has been
discussed several times in this forum
. The problem is that there are very good algorithms for finding the
shortest path between two nodes in a graph, but they don't easily generalize to
finding additional paths.
Greg's solution is to create a recursive algorithm, where you force the path to go through some arbitrary intermediate point and then try to find shortest paths from start to mid and from mid to end. By default, webtrees uses three levels of recursion, which is way too much computation for a large family tree. On my tree with 30k individuals, I use one level of recursion and still get plenty of alternate paths.
Replied by
fisharebest
on topic
Relationship to me - Charts menu
Control panel -> Modules -> Charts -> Relationship
Change the "recursion" level for this tree.
Reduce it (3, 2, 1, 0) until it works...
