Do I understand correctly that you are looking for identifying
connected components?
In this case, you probably want the MOKruskal algorithm. Take a look
at the description here:
http://www.moosetechnology.org/tools/moosealgos/graph
Simon, am I right?
Doru
On 10 Jun 2010, at 00:58, Alexandre Bergel wrote:
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
_______________________________________________
Moose-dev mailing list
Moose-dev(a)iam.unibe.ch
https://www.iam.unibe.ch/mailman/listinfo/moose-dev
--
www.tudorgirba.com
"Yesterday is a fact.
Tomorrow is a possibility.
Today is a challenge."