Apply permutation efficiently respecting architecture

Given:

• Permutation
• Architecture Graph

Find:

• Way to apply permutation respecting architecture graph that minimizes the cost.
• Cost of that routing

Possible Approaches:

1. Sorting network
2. Complete graph
3. Modular graph
4. Path
5. grid
6. Alon, Chung & Graham matchings routing.
7. Follow-up Paper
8. Maslov?

Implemented:

• Complete graph
• Modular graph
• Path, Product of graphs (e.g. Path x Path = Grid), Tree. See #14 (closed)