Chinese Postman Problem Algorithm #283
Conversation
|
Awesome, I haven't looked at the PR yet but I'm very intrigued, I will have a look as soon as possible =) |
| int matrixSize = getMatrixSize(); | ||
| int[][] costMatrix = new int[matrixSize][matrixSize]; | ||
| VertexPair[][] pairMatrix = new VertexPair[matrixSize][matrixSize]; | ||
| findUnbalanced(); |
There was a problem hiding this comment.
Not sure what happens here in the findUnbalanced() method, it looks like we process things without saving or acting upon the result, I might also be tired =)
There was a problem hiding this comment.
I can also see that "balance" the graph, if that would allow a path to be traversed several times, would be needed when we talk about traversing a model with the least amount of steps
There was a problem hiding this comment.
Not sure what happens here in the findUnbalanced() method, it looks like we process things without saving or acting upon the result, I might also be tired =)
This was meant to be where we first store negative and positive polarized vertices in their respective arrays neg[] and pos[], but I have realized that I should do that under polarize method, so I moved the operations there.
|
Could you add a unit test that show the algoritm in action? |
I have added a success and a fail test case, let me know if there is anything else you want me to add. |
2 participants
Hello everyone,
This PR is my attempt in implementing the feature that is requested in issue #34. I would appreciate any suggestion on how to improve this implementation of Chinese Postman Problem Algorithm. Hopefully it can provide any meaningful contribution to GraphWalker.
Sincerely,
Onur Enginer