algorithm - MST trees checker (kruskal) -


i have implemented kruskal's algorithm in c++ in leda library. so, stored in linked list edges belong mst, , not . so, wanna make checker program checks if edges rigth, checking if mst cycle property applied in tree. have make program leda's dynamic trees. overall question : if have these edges:

`u1-u2   u3-u5   u2-u3   ...` 

how can order them continues , like:

u1-u2 u2-u3 u3-u5 


Comments

Popular posts from this blog

'hasOwnProperty' in javascript -

python - ValueError: No axis named 1 for object type <class 'pandas.core.series.Series'> -

java - How to provide dependency injections in Eclipse RCP 3.x? -