route_model.cpp

#include "route_model.h"
#include <iostream>

RouteModel::RouteModel(const std::vector<std::byte> &xml) : Model(xml) {
  int counter = 0;
  for(Model::Node n:this->Nodes()){
    this->m_Nodes.push_back(RouteModel::Node(counter, this, n ));
    counter++;
  }
  CreateNodeToRoadHashmap();

}

void RouteModel::CreateNodeToRoadHashmap(){
  
  for(const Model::Road &road : Roads()){
    if(road.type != Model::Road::Type::Footway){

      for(const auto node : Ways()[road.way].nodes){
        if(node_to_road.find(node) == node_to_road.end()){
          node_to_road[node] = std::vector<const Model::Road*> {};
        }
        node_to_road[node].push_back(&road);
      }

    }

  }
      
}

RouteModel::Node *RouteModel::Node::FindNeighbor(std::vector<int> node_indices){
  Node *closest_node = nullptr;
  Node node;
  for(int node_index : node_indices){
    node = parent_model->SNodes()[node_index];
    if(this->distance(node) != 0  && !node.visited){
      if(closest_node == nullptr || this->distance(node) < this->distance(*closest_node)){
        closest_node  = &parent_model->SNodes()[node_index];
      }
    }
         
    
  }
  return closest_node;
  
}

void RouteModel::Node::FindNeighbors(){
	for(auto & road : parent_model->node_to_road[this->index]){
      RouteModel::Node *new_neighbor  = this->FindNeighbor(parent_model->Ways()[road->way].nodes);
	if(new_neighbor){
      this->neighbors.emplace_back(new_neighbor);
    }
      //if(new_neighbor){//is not null
        //this->neighbors.emplace_back(new_neighbor);
      //}
    }
  
}

auto &RouteModel::FindClosestNode(float x, float y){
  Node input;
  input.x = x;
  input.y = y;
  float min_dist = std::numeric_limits<float>::max();
  int closest_idx;
  float dist;
  for(auto &road : Roads()){
    if(road.type != Model::Road::Type::Footway) {
      
      
      for(const auto node_idx : Ways()[road.way].nodes){
        dist = input.distance(SNodes()[node_idx]);
        if(dist<min_dist){
          closest_idx = node_idx;
          min_dist = dist;
        }
        /*if(node_to_road.find(node) == node_to_road.end()){
          node_to_road[node] = std::vector<const Model::Road*> {};
        }
        node_to_road[node].push_back(&road);*/
      }
      
      
      
      
      ///end
    }
  }
  
  return SNodes()[closest_idx];
}