CEVA FOR !P OINT

#include <stdio.h>
#include <conio.h>
#include <iostream>

using namespace std;

/*Alba Iulia - Cluj Napoca = 98 km
Alba Iulia - Craiova = 296 km
Alba Iulia - Sibiu = 74 km
Alba Iulia - Timisoara = 219 km
Arad - Oradea = 116 km
Arad - Timisoara = 59 km
Baia Mare - Cluj Napoca = 151 km
Baia Mare - Satu Mare  = 62km
Bistrita - Cluj Napoca = 108 km
Bistrita - Suceava = 196 km
Bistrita - Targu Mures = 91 km
Braila - Bucuresti = 196 km
Braila - Piatra Neamt = 256 km
Braila - Tulcea = 95 km
Brasov - Bucuresti = 170 km
Brasov - Piatra Neamt = 226 km
Brasov - Pitesti = 140 km
Brasov - Sibiu = 145 km
Brasov - Targu Mures = 170 km
Bucuresti - Constanta = 227 km
Bucuresti - Piatra Neamt = 352 km
Bucuresti - Pitesti = 120 km
Cluj Napoca - Oradea = 157 km
Cluj Napoca - Targu Mures = 107 km
Constanta - Tulcea = 138 km
Craiova - Pitesti = 124 km
Craiova - Timisoara = 342 km
Iasi - Piatra Neamt = 130 km
Iasi - Suceava = 148 km
Oradea - SatuMare = 138 km
Sibiu - Targu Mures = 114 km
*/

int a[20][20];
int km[20][20];
int vizitat[20];

/*void Afisare() {
	for (int i = 0; i < 20; i++) {
		for (int j = 0; j < 20; j++) {
			cout << a[i][j] << " ";
		}
		cout << endl;
	}
}*/


void main() {

	const char *nume[20] = { "Alba Iulia_0" , "Arad_1", "Baia Mare_2", "Bistrita_3","Braila_4", "Brasov_5", "Bucuresti_6","Cluj Napoca_7", "Constanta_8", "Craiova_9", "Iasi_10","Oradea_11","Piatra Neamt_12","Pitesti_13","Satu Mare_14","Sibiu_15", "Suceava_16","Targu Mures_17", "Timisoara_18","Tulcea_19" };

	a[0][7] = 1;// 98;
	a[0][9] = 1;// 296;
	a[0][15] = 1;// 74;
	a[0][18] = 1;// 219;
	a[1][11] = 1;// 116;
	a[1][18] = 1;// 59;
	a[2][7] = 1;// 151;
	a[2][14] = 1;//62;
	a[3][7] = 1;// 108;
	a[3][16] = 1;// 196;
	a[3][17] = 1;// 91;
	a[4][6] = 1;// 196;
	a[4][12] = 1;// 256;
	a[4][19] = 1;// 95;
	a[5][6] = 1;// 170;
	a[5][12] = 1;// 226;
	a[5][13] = 1;// 140;
	a[5][15] = 1;// 145;
	a[5][17] = 1;// 170;
	a[6][8] = 1;// 227;
	a[6][12] = 1;// 352;
	a[6][13] = 1;// 120;
	a[7][11] = 1;// 157;
	a[7][17] = 1;// 107;
	a[8][19] = 1;// 138;
	a[9][13] = 1;// 124;
	a[9][18] = 1;// 342;
	a[10][12] = 1;// 130;
	a[10][16] = 1;// 148;
	a[11][14] = 1;// 138;
	a[15][17] = 1;// 114;

	km[0][7] = 98;
	km[0][9] =  296;
	km[0][15] =  74;
	km[0][18] = 219;
	km[1][11] = 116;
	km[1][18] =  59;
	km[2][7] =  151;
	km[2][14] = 62;
	km[3][7] = 108;
	km[3][16] = 196;
	km[3][17] =  91;
	km[4][6] =  196;
	km[4][12] =  256;
	km[4][19] = 95;
	km[5][6] =  170;
	km[5][12] =  226;
	km[5][13] =  140;
	km[5][15] = 145;
	km[5][17] =  170;
	km[6][8] =  227;
	km[6][12] =  352;
	km[6][13] =  120;
	km[7][11] =  157;
	km[7][17] =  107;
	km[8][19] =  138;
	km[9][13] =  124;
	km[9][18] =  342;
	km[10][12] = 130;
	km[10][16] = 148;
	km[11][14] = 138;
	km[15][17] = 114;

	/*km[7][0] = 98;
	km[9][0] = 296;
	km[15][0] = 74;
	km[18][0] = 219;
	km[11][1] = 116;
	km[18][1] = 59;
	km[7][2] = 151;
	km[14][2] = 62;
	km[7][3] = 108;
	km[16][3] = 196;
	km[17][3] = 91;
	km[6][4] = 196;
	km[12][4] = 256;
	km[19][4] = 95;
	km[6][5] = 170;
	km[12][5] = 226;
	km[13][5] = 140;
	km[15][5] = 145;
	km[17][5] = 170;
	km[8][6] = 227;
	km[12][6] = 352;
	km[13][6] = 120;
	km[11][7] = 157;
	km[17][7] = 107;
	km[19][8] = 138;
	km[13][9] = 124;
	km[18][9] = 342;
	km[12][10] = 130;
	km[16][10] = 148;
	km[14][11] = 138;
	km[17][15] = 114;*/

	int noduri[20];
	int nr_noduri = 0;
	int n = 20;
	int oras_Start, oras_Destinatie;
	int solutie[20];
	int parinte[20];
	int nr_solutie = 0;
	int kmTotali = 0;

	for (int i = 0; i < 20; i++) {
		for (int j = 0; j < 20; j++) {
			a[j][i] = a[i][j];
			km[j][i] = km[i][j];
		}
	}

	int cautare;

	cout << "Introduceti indicele orasului caruia vreti sa ii aflam vecinii: "; cin >> cautare; cout << endl;
	for (int i = 0; i < 20; i++)
		if (a[cautare][i] == 1) {
			cout << nume[i] << " ";
		}
	// CAUTAREA IN LATIME

	cout << endl << "Introduceti orasul de start: "; cin >> oras_Start;
	cout << endl << "Introduceti orasul de final: "; cin >> oras_Destinatie;

	noduri[0] = oras_Start;
	nr_noduri++;
	vizitat[oras_Start] = 1;
	int gasit = 0;
	int nod;//nodul curent pe care il initializam
	while (gasit == 0 && (nr_noduri != 0)) {
		nod = noduri[0];//scoatem primul element din lista de noduri si il retinem in noduri
		for (int i = 0; i < nr_noduri - 1; i++) {
			noduri[i] = noduri[i + 1];
		}
		nr_noduri--;
		if (nod == oras_Destinatie) {
			gasit = 1;
		}
		else {
			for (int i = 0; i < 20; i++) {
				if ((a[nod][i] == 1) && (vizitat[i] == 0)) {
					noduri[nr_noduri] = i;
					nr_noduri++;
					vizitat[i] = 1;
					parinte[i] = nod;
				}
			}
		}
	}

	if (gasit == 0) {
		cout << "\nNu s-a gasit\n\n";
	}
	else {

		while (oras_Destinatie != oras_Start) {
			solutie[nr_solutie++] = oras_Destinatie;
			oras_Destinatie = parinte[oras_Destinatie];
		}
		solutie[nr_solutie] = oras_Start;

	}
	cout << "\nCel mai rapid drum este\n";
	for (int i = nr_solutie; i >= 0; i--) {
		cout << nume[solutie[i]] << " ";
		if (i > 0) {
			kmTotali += km[solutie[i]][solutie[i - 1]];
		}
	}
	cout << "\nKm = " << kmTotali;

	_getch();
}