GraphDijkstraState.init constructor

GraphDijkstraState.init(
  1. ID startId,
  2. ID targetId,
  3. HashMap<ID, (double, double)> coords,
  4. HashMap<ID, List<ID>> edges,
)

Implementation

GraphDijkstraState.init(
  ID startId,
  ID targetId,
  HashMap<ID, (double, double)> coords,
  HashMap<ID, List<ID>> edges,
) : super.init(startId, targetId, coords, edges) {
  gCost = HashMap.from({startId: 0.0});
  open = PriorityQueue<ID>((a, b) => gCost[a]!.compareTo(gCost[b]!));
  open.add(startId);
  nodes[startId] = GraphNode.open;
}