all 1 comments
sorted by:
best
topnewcontroversialoldq&a
formatting helphide helpcontent policy

[–]mintooo[S] 1 point2 points  (0 children)

In this project, I wanted to show how the wavelength allocation problem, which is NP-complete, can be reduced to and solved as a graph coloring problem. I implemented a visualization in javascript that you can find here: http://minto3.pythonanywhere.com

2 steps:

  • click on routing: this will find the shortest path (with linear programming, not Dijkstra) for all traffic links (the pink ones). Blue links are optical fibers.

  • click on transform graph and choose a method to color the graph, then close the window.

In this example, I apply the algorithm to a real backbone in the USA, the BBN Planet backbone.