pew/cccmap-dij
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
Paul Walko
2016-12-27 01:42:54 -05:00
committed by GitHub
parent f9762d02dd
commit e50a535ca6
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
README.md
View File

@@ -2,7 +2,7 @@
Uses a graph structure to calculate sthe most efficient order to take 6 given merit badges (throughout different areas) and a campsite in Uses a graph structure to calculate sthe most efficient order to take 6 given merit badges (throughout different areas) and a campsite in
#Usage #Usage
python dij.py campSite area area2 area3 area4 area5 area6 python dij.py area1 area2 area3 area4 area5 area6 area7
```python ```python
python dij.py seven handi aqua kiwanis cope cope cope python dij.py seven handi aqua kiwanis cope cope cope
``` ```