Go to file
Paul Walko e50a535ca6 Update README.md 2016-12-27 01:42:54 -05:00
LICENSE Initial commit 2015-12-23 05:52:25 -05:00
README.md Update README.md 2016-12-27 01:42:54 -05:00
dij.py init commit 2015-12-23 05:54:39 -05:00



Uses a graph structure to calculate sthe most efficient order to take 6 given merit badges (throughout different areas) and a campsite in

#Usage python dij.py area1 area2 area3 area4 area5 area6 area7

python dij.py seven handi aqua kiwanis cope cope cope

**Current areas: cope, gun, eco, skills, archery, health, admin, dining, aqua, handi, dan, ftown, kiwanis, one, two, ..., fourteen (all campsites)

Camp Map for Reference: