result.cpp

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

// Result.cpp: implementation of the Result class.
//
//////////////////////////////////////////////////////////////////////

#include "Result.h"

//////////////////////////////////////////////////////////////////////
// Construction/Destruction
//////////////////////////////////////////////////////////////////////

Result::Result(int size)
{
	r_size = size;
	dist = new int[size];
	for(int i=0; i<r_size; i++){
		dist[i] = -1;
	}
}

Result::~Result()
{
	delete [] dist;
}

void Result::printResult()
{
	for(int i=0; i<r_size; i++){
		cout<<"\t";
		if(dist[i]!=INT_MAX){
			cout<<dist[i];
		}
		else{
			cout<<"?";
		}
	}
	cout<<endl;
}