Documente Academic
Documente Profesional
Documente Cultură
//
#include "stdafx.h"
#include <conio.h>
#include <iostream>
using namespace std;
int main() {
char *nume[20] = { "Arad", "Bucuresti", "Craiova", "Drobeta", "Eforie",
"Fagaras", "Giurgiu", "Harsova", "Iasi", "Lugoj", "Mehadia", "Neamt", "Oradea",
"Pitesti", "Rm Valcea", "Sibiu", "Timisoara", "Urziceni", "Vaslui", "Zerind" };
// 0 1 2 3 4
5 6 7 8 9 10 11 12 13
14 15 16 17 18 19
int a[20][20], i, j, k, l, n = 20;
int oras_start = 0, oras_dest = 1, vizitat[20], noduri[20], nr_noduri = 1,
gasit = 0, nod;
int parinte[20], solutie[20], nr_solutie = 0;
int cost[20], cost_nod;
int h[20] = { 366, 0, 160, 242, 161, 176, 77, 151, 226, 244, 241, 234, 380,
10, 193, 253, 329, 80, 199, 374 }; // vector euristica
//matricea de adiacenta
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
a[i][j] = 0;
a[0][15] = 140;
a[0][16] = 118;
a[0][19] = 75;
a[1][5] = 211;
a[1][6] = 90;
a[1][13] = 101;
a[1][17] = 85;
a[2][3] = 120;
a[2][13] = 138;
a[2][14] = 145;
a[3][10] = 75;
a[4][7] = 85;
a[5][15] = 99;
a[7][17] = 98;
a[8][11] = 87;
a[8][18] = 92;
a[9][10] = 70;
a[9][16] = 111;
a[12][15] = 151;
a[12][19] = 71;
a[13][14] = 97;
a[14][15] = 80;
a[17][18] = 142;
}
}
cost_nod = cost[oras_dest];
_getch();
}