GraphDijkstraState constructor

GraphDijkstraState({ required ID startId, required ID targetId, required HashMap<ID, GraphNode> nodes, required HashMap<ID, List<ID>> edges, required HashMap<ID, ID> parents, required HashMap<ID, (double, double)> coords, required Status status, required PriorityQueue<ID> open, required HashMap<ID, double> gCost, })

Implementation

GraphDijkstraState({
  required super.startId,
  required super.targetId,
  required super.nodes,
  required super.edges,
  required super.parents,
  required super.coords,
  required super.status,
  required this.open,
  required this.gCost,
});