stdafx.h

this is the code for finding a shortedpath in graph in althorithm

// stdafx.h : include file for standard system include files,
// or project specific include files that are used frequently, but
// are changed infrequently
//

#pragma once


#define WIN32_LEAN_AND_MEAN		// Exclude rarely-used stuff from Windows headers
#include <stdio.h>
#include <tchar.h>

#include<iostream>
#include<vector>
#include<stdlib.h>
#include<conio.h>
#include<fstream>
using namespace std;

class dijkstra
{
private:
	//vector<int> graph[10];
	//int set[15];
	int graph[10][10];
	int Nhan[15];
	int mark[15];
	int DoDai[15];
	int source;
	int destination;
	int num_of_vertices;
public:
	int minimum();
	void read(char* filename);
	void initialize();
	void printpath(int);
	void algorithm();
	void output();
};
// TODO: reference additional headers your program requires here