GraphDijkstraState constructor

GraphDijkstraState({
  1. required ID startId,
  2. required ID targetId,
  3. required HashMap<ID, GraphNode> nodes,
  4. required HashMap<ID, List<ID>> edges,
  5. required HashMap<ID, ID> parents,
  6. required HashMap<ID, (double, double)> coords,
  7. required Status status,
  8. required PriorityQueue<ID> open,
  9. 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,
});