i'm trying to find an algorithm that will divide my graph in 2 parts by telling me what connections should be broken but the 2 parts should contain about the same number of nodes
its for a practical problem that i'm implementing. the graph will never have more then 64 nodes.
this will be applied to a 64 nodes graph every time the program runs. the connections have distances from 0-90, where 90 is far apart
the described algorithm sounds good is it an existing one? can you get a link to pseudo code? or should i try implementing it myself ^^