ChristofidesAlgorithm

ChristofidesAlgorithm copied to clipboard

visited array initialization issue

1

in line 26, it should be: ```python visited[current] = True ``` instead of ```python visited[0] = True ```

frostace

bug in definition of "minimum-weight perfect matching" function

5

https://github.com/Retsediv/ChristofidesAlgorithm/blob/7e85e6de9fad5cc2ac21572af4d8c0f60dbe90fb/christofides.py#L129 The current approach doesn't ensure minimum weighted edges from odd_vert with no two edge-sharing same vertices. the function should be instead: ``` def minimum_weight_matching(MST, G, odd_vert): vertices = []...

Shriyanshagro

For the minimum_spanning_tree(G) function, the for loop should be `for W, u, v in sorted((G[u][v], u, v) for u in range(len(G)) for v in range(len(G[u]))):`

lilly-yang-th

Hello there. I stumbled upon your codings for my Algorithm Design course assignment. I tried to run it but I seem to not understand the output generated by the coding....

mdrhmn