Fix test for ShortestPath for undirected graphs

dominikbraun · Mar 27, 2023 · 465eb9e · 465eb9e
1 parent d1c7144
commit 465eb9e
Showing 1 changed file with 6 additions and 0 deletions.
diff --git a/paths_test.go b/paths_test.go
@@ -303,6 +303,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 		edges                []Edge[string]
 		sourceHash           string
 		targetHash           string
+		isWeighted           bool
 		expectedShortestPath []string
 		shouldFail           bool
 	}{
@@ -320,6 +321,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 				{Source: "F", Target: "G", Properties: EdgeProperties{Weight: 5}},
 				{Source: "G", Target: "B", Properties: EdgeProperties{Weight: 2}},
 			},
+			isWeighted:           true,
 			sourceHash:           "A",
 			targetHash:           "B",
 			expectedShortestPath: []string{"A", "C", "E", "B"},
@@ -332,6 +334,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 				{Source: "B", Target: "D", Properties: EdgeProperties{Weight: 2}},
 				{Source: "C", Target: "D", Properties: EdgeProperties{Weight: 2}},
 			},
+			isWeighted:           true,
 			sourceHash:           "A",
 			targetHash:           "D",
 			expectedShortestPath: []string{"A", "B", "D"},
@@ -359,6 +362,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 				{Source: "B", Target: "D", Properties: EdgeProperties{Weight: 2}},
 				{Source: "C", Target: "D", Properties: EdgeProperties{Weight: 2}},
 			},
+			isWeighted:           true,
 			sourceHash:           "B",
 			targetHash:           "B",
 			expectedShortestPath: []string{"B"},
@@ -369,6 +373,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 				{Source: "A", Target: "B", Properties: EdgeProperties{Weight: 2}},
 				{Source: "A", Target: "C", Properties: EdgeProperties{Weight: 4}},
 			},
+			isWeighted:           true,
 			sourceHash:           "A",
 			targetHash:           "D",
 			expectedShortestPath: []string{},
@@ -378,6 +383,7 @@ func TestUndirectedShortestPath(t *testing.T) {
 
 	for name, test := range tests {
 		graph := New(StringHash)
+		graph.(*undirected[string, string]).traits.IsWeighted = test.isWeighted
 
 		for _, vertex := range test.vertices {
 			_ = graph.AddVertex(vertex)