Paul Walko d2191ecdeb | ||
---|---|---|
LICENSE | ||
README.md | ||
dij.py |
README.md
cccmap
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 campSite area area2 area3 area4 area5 area6
python dij.py seven handi aqua kiwanis cope cope cope
**Current areas are cope, gun, eco, skills, archery, health, admin, dining, aqua, handi, dan, ftown, kiwanis