Skip to content

Improve mixed max cut algorithm - #13

Merged
SimGo123 merged 5 commits into
mainfrom
mixed-max-improve
Oct 3, 2023
Merged

SimGo123 merged 5 commits into
mainfrom
mixed-max-improve

Conversation

@SimGo123

@SimGo123 SimGo123 commented Oct 3, 2023 •

Copy link
Copy Markdown
Owner

Use ColorSet to color important parts of the graph
Don't run further if dual graph contains loops/multi-edges
Allow modifying the graph while in the process of running/stepping through the algorithm
Use result of standard WeightMaxMatching algorithm (not brute-force for the entire graph)
Furthermore, important additions to the WeightMaxMatching algorithm.

WeightMaxMatching can only be run on a planar embedded graph.
Therefore, keep showing the algo control panels while user might change graph.
Furthermore, make WeightMaxMatching return edges of the matching.
Don't process further if dual graph contains loops/multi-edges
Determine number of steps
@SimGo123
SimGo123 merged commit 962b7b4 into main Oct 3, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant