Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Solver optimization #4

Open
luiges90 opened this issue Mar 2, 2013 · 0 comments
Open

Solver optimization #4

luiges90 opened this issue Mar 2, 2013 · 0 comments
Labels
enhancement

Comments

@luiges90
Copy link
Owner

luiges90 commented Mar 2, 2013

Algorithm to be implemented to check impossibility quick.

  1. Find all disjoint areas cut by arrows, stickies.
  2. Draw a graph G with each area being a vertex on graph, and if one area can reach the other, draw a directed edge.
  3. Reverse the direction of edges of G
  4. If there exists a vertex in G that can reach every other vertex (by DFS), and the area it represents is not full of no-match area, the puzzle is possible, and vice versa.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@luiges90