Hi!
I haven't closely followed the status of the moose algo. I am looking for a way to get
group of interconnected nodes.
A simple test would be:
testCycle1
| view |
view := MOViewRenderer new.
view nodes: (1 to: 5).
view edges: {1 -> 2. 2 -> 3 . 4 -> 5} from: #key to: #value.
view treeLayout.
window := view open.
self assert: (view root numberOfDistinctGroups = 2).
self assert: (view root distinctGroups first includesAllOf: (1 to: 3)).
self assert: (view root distinctGroups second includesAllOf: (4 to: 5)).
Is there some material that I can use to code #numberOfDistinctGroups and #distinctGroups
?
Cheers,
Alexandre