work
This commit is contained in:
@@ -1,7 +1,6 @@
|
||||
package dijkstra
|
||||
|
||||
import (
|
||||
"fmt"
|
||||
"math"
|
||||
"sync"
|
||||
)
|
||||
@@ -92,7 +91,7 @@ func getShortestPath(startNode *Node, endNode *Node, g *ItemGraph) ([]Point, int
|
||||
pathval = prev[pathval]
|
||||
}
|
||||
finalArr = append(finalArr, pathval)
|
||||
fmt.Println(finalArr)
|
||||
// fmt.Println(finalArr)
|
||||
for i, j := 0, len(finalArr)-1; i < j; i, j = i+1, j-1 {
|
||||
finalArr[i], finalArr[j] = finalArr[j], finalArr[i]
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user