test bfs shortest path

arnauddri · Jan 14, 2015 · 67ebf06 · 67ebf06
1 parent 5352dd8
commit 67ebf06
Show file tree

Hide file tree

Showing 2 changed files with 25 additions and 8 deletions.
diff --git a/bfs_shortest_path.go b/bfs_shortest_path.go
@@ -1,13 +1,11 @@
 package graph
 
-import (
-	"fmt"
-)
+import ()
 
-func bfsShortestPath(g *Graph, start VertexId) {
+func bfsShortestPath(g *Graph, start VertexId) (dist map[VertexId]int) {
 	queue := []VertexId{start}
 	visited := make(map[VertexId]bool)
-	dist := make(map[VertexId]int)
+	dist = make(map[VertexId]int)
 	var next []VertexId
 
 	for len(queue) > 0 {
@@ -27,6 +25,5 @@ func bfsShortestPath(g *Graph, start VertexId) {
 		}
 		queue = next
 	}
-	fmt.Println(g)
-	fmt.Println(dist)
+	return
 }
diff --git a/graph_test.go b/graph_test.go
@@ -115,10 +115,30 @@ func TestBfs(t *testing.T) {
 		h.AddEdge(VertexId(i), VertexId(i+1))
 	}
 
-	bfsShortestPath(h, VertexId(1))
 	bfs(h, VertexId(2))
 }
 
+func TestBfsShortestPath(t *testing.T) {
+	h := NewGraph()
+
+	for i := 0; i < 10; i++ {
+		v := VertexId(i)
+		h.AddVertex(v)
+	}
+
+	for i := 0; i < 9; i++ {
+		h.AddEdge(VertexId(i), VertexId(i+1))
+	}
+
+	distance := bfsShortestPath(h, VertexId(0))
+
+	for i := 0; i < len(distance); i++ {
+		if distance[VertexId(i)] != i {
+			t.Error()
+		}
+	}
+}
+
 func TestDfs(t *testing.T) {
 	h := NewGraph()