clearer lines

This commit is contained in:
Adam Millerchip 2020-12-11 01:04:13 +09:00
parent c5745fbaaa
commit 4b1dab72a5

View file

@ -37,13 +37,13 @@ forms a directed graph, where the weight of each node inherits the weight of all
For the example case (excuse my ascii drawing skills): For the example case (excuse my ascii drawing skills):
0(1)-1(1)-4(1)-5(1)-| 0(1)-1(1)-4(1)-5(1)-|
| ` | | | \ | |
|---6(2) | |---6(2) |
| | | | | |
|---7(4)-| |---7(4)-|
| |
10(4)-11(4) 10(4)-11(4)
` | \ |
12(8)-18(8)-19(8) 12(8)-18(8)-19(8)
So just need to make an algorithm that builds this graph, by iterating the sorted list So just need to make an algorithm that builds this graph, by iterating the sorted list