Success! The matching appears to work!
I have successfully fixed several errors in my code, most of which were with my loops (NB: Fear the ConcurrentModificationException, it makes life difficult). The algorithm works as mentioned in my previous post and checks both vertices of an edge, against the vertices in an "already matched" list, making it semi-efficient. Research and consultation will tell if its as efficient as it could be, but a working algorithm is good news regardless!
I have tested the algorithm with my several small graphs, however I intend to stress test it over the weekend with some others to find if any subtle bugs exist. The next step will be to combine the matchings into single vertices (creating the coarser graph) using the vertices array structure used previously, and then to try and iterate this process (first 2 times, then implement a method of determining the coarsest graph).
I will post test results next week (if not over the weekend), have a good fireworks night!
No comments:
Post a Comment