petrasvestartas
New member
- Joined
- Oct 23, 2016
- Messages
- 1
- Programming Experience
- 1-3
Hi,
I would like to ask how to split graphs into segments (components) at nodes that have 3 or more edges?
I wrote my own library for graphs using C#, that implements basic algorithms (Breadth First Search, Depth First search and etc). Then I made a short if else loop to remove edges at nodes that have 3 or more edges. It works quite well, but it results in both very long and short elements. Just as my printscreen below.
I would like to ask what are the algorithms called, that could split graphs / minimum spanning trees evenly?
Kind Regards,
Petras
I would like to ask how to split graphs into segments (components) at nodes that have 3 or more edges?
I wrote my own library for graphs using C#, that implements basic algorithms (Breadth First Search, Depth First search and etc). Then I made a short if else loop to remove edges at nodes that have 3 or more edges. It works quite well, but it results in both very long and short elements. Just as my printscreen below.
I would like to ask what are the algorithms called, that could split graphs / minimum spanning trees evenly?
Kind Regards,
Petras
