result.h

I implement Dijkstra s Single Source Shortest Path, say SSP, algorithm for directed graphs using a s

// Result.h: interface for the Result class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_RESULT_H__5FADF91B_E6AC_4FE8_8E12_5F22589F1C22__INCLUDED_)
#define AFX_RESULT_H__5FADF91B_E6AC_4FE8_8E12_5F22589F1C22__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000

#include<iostream>

using namespace std;

class Result  
{
public:
	int * dist;
	void printResult();
	Result(int size);
	~Result();
	int r_size;

};

#endif // !defined(AFX_RESULT_H__5FADF91B_E6AC_4FE8_8E12_5F22589F1C22__INCLUDED_)