Function BNode_FindPath

Descent3/bnode.cpp:212–288

Ok to use Highest_room_index offset stuff

// Ok to use Highest_room_index offset stuff
bool BNode_FindPath(int start_room, int i, int j, float rad) {
  bpq PQPath;
  int counter;
  pq_item *start_node = new pq_item(i, -1, 0.0f);
  pq_item *cur_node;
  bool f_found = false;

  //	mprintf(0, "++++++++++\nFind path from %d to %d in room %d\n", i, j, start_room);

  start_room = BOA_INDEX(start_room);

  pq_item **node_list;
  bn_list *bnlist = BNode_GetBNListPtr(start_room);

  ASSERT(bnlist);
  ASSERT(i >= 0 && i < bnlist->num_nodes && j >= 0 && j < bnlist->num_nodes);

  node_list = (pq_item **)mem_malloc(bnlist->num_nodes * sizeof(pq_item *));
  memset(node_list, 0, bnlist->num_nodes * sizeof(pq_item *));

  PQPath.push(start_node);

  while ((cur_node = PQPath.pop())) {
    node_list[cur_node->node] = cur_node;

    if (cur_node->node == j) {
      BNode_UpdatePathInfo(node_list, i, j);
      f_found = true;
      goto done;
    }

    int num_edges;

    num_edges = bnlist->nodes[cur_node->node].num_edges;

    for (counter = 0; counter < num_edges; counter++) {
      int next_node;
      pq_item *list_item;
      float new_cost;

      //			if(!BOA_PassablePortal(cur_node->roomnum, counter, false, false))
      //				continue;

      if ((next_node = bnlist->nodes[cur_node->node].edges[counter].end_room != start_room))
        continue;

      next_node = bnlist->nodes[cur_node->node].edges[counter].end_index;

      ASSERT(bnlist->nodes[cur_node->node].edges[counter].cost > 0);
      new_cost = cur_node->cost + bnlist->nodes[cur_node->node].edges[counter].cost;

      list_item = node_list[next_node];

      if (list_item != NULL && list_item->cost < new_cost)
        continue;

      if (list_item == NULL) {
        list_item = new pq_item(next_node, cur_node->node, new_cost);