I want to know the details interpretation of this code for my
interview preperation on this code. This is A* algorithm in c++
#include<bits/stdc++.h>
using namespace std;
#define DISCONNECTED -1
int num_of_node,num_of_edge,graph[30][30],pathCost[30];
void init_Heuristic();
struct Node{
int from,to;
int cost;
};
struct CompareNode{
bool operator()(Node& n1, Node&
n2){
if(n1.cost >
n2.cost)return true;
return false;
}
};
map<int,int>Heuristic;
priority_queue<Node, vector<Node>, CompareNode>
PQ;
vector<Node>path;
void AStarSearch(int source,int destination){
init_Heuristic();
for(int i = 1; i...