distset.h

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

#if !defined(DIST_H)
#define DIST_H

#include <iostream>
#include <time.h>

using namespace std; 

/*
 *Declaring the basic structur for storing the medium info for Dijkstra
 *Basic class for class ArraySet, FHeap and PHeap 
 */
class DistSet
{
public:
	DistSet(int size = 0);
public:
	~DistSet(void);
public:
	virtual int insert(int node, int dist)=0;
public:
	virtual int decreasDist(int node, int newDist)=0;
public:
	virtual int deleteMin(void)=0;
public:
	virtual void initial(void)=0;
public:
	/*
	 *return true if the set is empty.
	 *or else r
	 */
	bool IsEmpty(void)
	{
		return currentSize==0;
	}
protected:
	int currentSize;
	int maxSize;
};

#endif