Can not get more than 1 path with ShortestAll

[tegk]

How do i use the new ShortestAll function properly?

Output generated:

1
Shortest distance  1  following path  [0 2 3]

Expected output:

2
Shortest distance  1  following path  [0 1 3]
Shortest distance  1  following path  [0 2 3]

Code:

package main

import (
	"fmt"
	"github.com/RyanCarrier/dijkstra"
	"log"
)


func main() {
	graph := dijkstra.NewGraph()
	//Add the 4 verticies
	graph.AddVertex(0)

	graph.AddVertex(1)
	graph.AddVertex(2)

	graph.AddVertex(3)

	//Add the arcs
	graph.AddArc(0, 1, 1)
	graph.AddArc(0, 2, 1)

	graph.AddArc(1, 3, 0)
	graph.AddArc(2, 3, 0)

	best, err := graph.ShortestAll(0, 3)
	if err != nil {
		log.Fatal(err)
	}
	fmt.Println(len(best))
	for _, v := range best {
		fmt.Println("Shortest distance ", v.Distance, " following path ", v.Path)

	}
}

[RyanCarrier]

Turns out I'm actually braindead, I'll fix this at some point, sorry

[RyanCarrier]

Working correctly now. Thanks for letting me know

[tegk]

I can confirm that this works now. Thank you, for the great work!