@@ -439,8 +439,8 @@ func TestToGonumGraphObj(t *testing.T) {
439
439
func compareGraphs (expected , actual graph.Directed , t * testing.T ) {
440
440
// sort the edges by from ID, then to ID
441
441
// (the slices we get back are from map iteration, where order is not guaranteed)
442
- expectedNodes := expected .Nodes ()
443
- actualNodes := actual .Nodes ()
442
+ expectedNodes := expected .Nodes ().(graph. NodeSlicer ). NodeSlice ()
443
+ actualNodes := actual .Nodes ().(graph. NodeSlicer ). NodeSlice ()
444
444
sort .Sort (gonumByUID (expectedNodes ))
445
445
sort .Sort (gonumByUID (actualNodes ))
446
446
@@ -455,8 +455,8 @@ func compareGraphs(expected, actual graph.Directed, t *testing.T) {
455
455
t .Errorf ("expected %v, got %v" , spew .Sdump (currExpected ), spew .Sdump (currActual ))
456
456
}
457
457
458
- expectedFrom := append ([]graph.Node {}, expected .From (expectedNodes [i ].ID ())... )
459
- actualFrom := append ([]graph.Node {}, actual .From (actualNodes [i ].ID ())... )
458
+ expectedFrom := append ([]graph.Node {}, expected .From (expectedNodes [i ].ID ()).(graph. NodeSlicer ). NodeSlice () . .. )
459
+ actualFrom := append ([]graph.Node {}, actual .From (actualNodes [i ].ID ()).(graph. NodeSlicer ). NodeSlice () . .. )
460
460
sort .Sort (gonumByUID (expectedFrom ))
461
461
sort .Sort (gonumByUID (actualFrom ))
462
462
if len (expectedFrom ) != len (actualFrom ) {
0 commit comments