Parmeggiani-Lab / elfin-solver

Standard Genetic Algorithm solver for elfin
MIT License
0 stars 0 forks source link

Better 2H team #24

Closed joy13975 closed 5 years ago

joy13975 commented 5 years ago
  1. Reject 2H cases where XDB does not contain a path between the two hinges.

  2. Maintain the above property throughout GA.

joy13975 commented 5 years ago

Note: enumerating all paths or even simple paths between two arbitrary source and destination nodes is NP-hard.

To determine whether two hinges have a valid path in XDB, we need to check more than just simple paths. See H.blend where multiple instances of D49 and D49_aC2_ext are required to form a path.

When cycles are invovled, there can be infinite paths between two nodes.