diff --git a/util/dijkstra/dijkstra.go b/util/dijkstra/dijkstra.go
index 558a12709a00c40f8e435d0b57584332fbd50b77..9a7a4a20842e27d0c5b482e039502c5927303b90 100644
--- a/util/dijkstra/dijkstra.go
+++ b/util/dijkstra/dijkstra.go
@@ -28,7 +28,7 @@ type Path struct {
 }
 
 // NewTopology creates a new topology
-func NewTopologay(nodes []Node, edges []Edge) *Topology {
+func NewTopology(nodes []Node, edges []Edge) *Topology {
 	t := &Topology{
 		nodes: make(map[Node]int64),
 		edges: make(map[Node]map[Node]int64),
diff --git a/util/dijkstra/dijkstra_test.go b/util/dijkstra/dijkstra_test.go
index 21c1c17c1b9474e4fffc1b50fd6c917fe3b2d47e..3d162d7820f61167d268e5cc93d14cc1d5b7cce9 100644
--- a/util/dijkstra/dijkstra_test.go
+++ b/util/dijkstra/dijkstra_test.go
@@ -234,7 +234,7 @@ func TestSPT(t *testing.T) {
 	}
 
 	for _, test := range tests {
-		top := NewTopologay(test.nodes, test.edges)
+		top := NewTopology(test.nodes, test.edges)
 		spt := top.SPT(Node{Name: "A"})
 
 		assert.Equalf(t, test.expected, spt, "Test %q", test.name)