     EdgeLengths.Value == Distance
   {
     var vertexVisitationState = makeDefaultColorMap(repeating: VertexColor.white)
-    var distancesToVertex = TablePropertyMap(repeating: effectivelyInfinite, forVerticesIn: self)
+    var distancesToVertex = TablePropertyMap(repeating: Distance.effectiveInfinity, forVerticesIn: self)
 
     try dijkstraSearch(
       startingAt: startVertex,

    EdgeLengths.Value == Distance
  {
    var vertexVisitationState = makeDefaultColorMap(repeating: .white)
    var distancesToVertex = DictionaryPropertyMap(repeating: effectivelyInfinite, forVerticesIn: self)

    do {
      try dijkstraSearch(

    }
  }

  /// Returns the vertices along the path from `startVertex` to `goalVertex` and their distances
  /// from `startVertex` using `edgeLengths` to determine the cost of traversing an edge; `callback`
  /// is called regularly during search execution.
  public mutating func dijkstraShortestPath<
    Distance: GraphDistanceMeasure,
    EdgeLengths: PropertyMap
  >(
    from startVertex: VertexId,
