Add Dijkstra's algorithm and graphutils module
Review Request #7327 — Created May 21, 2015 and submitted
This patch adds the
diffviewer.graphutilsmodule which will contain
general purpose graph algorithms, the first of which being Dijkstra's
shortest path algorithm.
Ran unit tests.
| Description | From | Last Updated |
|---|---|---|
|
Col: 1 W391 blank line at end of file |
|
|
|
Can you clarify in here exactly what the input and output formats are supposed to be? I can figure it … |
|
|
|
Col: 1 E302 expected 2 blank lines, found 1 |
|
|
|
We should avoid using _ as a variable in any code, since by convention, we're using _ for gettext or … |
|
|
|
It might be nicer to have one big assert statement (compare distances against a dict that you create). |
|
|
|
Same here. |
|
- Change Summary:
-
PEP8
- Commit:
-
71a83e0c173c1caabb02d4511db3e3cc988664024eafb28253e5db8e37c0a9dd723c9b9182503ec3
-
Tool: PEP8 Style Checker Processed Files: reviewboard/diffviewer/graphutils.py Tool: Pyflakes Processed Files: reviewboard/diffviewer/graphutils.py
-
Tool: Pyflakes Processed Files: reviewboard/diffviewer/tests.py reviewboard/diffviewer/graphutils.py Tool: PEP8 Style Checker Processed Files: reviewboard/diffviewer/tests.py reviewboard/diffviewer/graphutils.py
- Change Summary:
-
Address Christian's and David's issues.
- Commit:
-
f4361fdf4f09bf8f367f15c5db436b8343c7398ff65ae49002401cddf41fb6a175572f6cc2a95979
Tool: Pyflakes Processed Files: reviewboard/diffviewer/graphutils.py Tool: PEP8 Style Checker Processed Files: reviewboard/diffviewer/graphutils.py