[−][src]Type Definition rs_graph::search::biastar::DefaultPriQueue

type DefaultPriQueue<'a, A, D, H, ID = u32> = BinHeap<Direction<<A as GraphType<'a>>::Node>, BiData<<A as GraphType<'a>>::Edge, D, H>, ID>;

Default priority queue type to be used in an A* search.

  • A is the graph type information
  • D is the type of distance values
  • H is the type of heuristic values
  • ID is used for identifying items on the heap internally