pheap.h

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

#pragma once
#include "distset.h"

class PHeapNode
{
public:
	int dist;
	int node;
    PHeapNode *left, *right;
    PHeapNode *child;
};

class PHeap :
	public DistSet
{
public:
	PHeap(int);
public:
	~PHeap(void);
public:
	virtual int insert(int node, int dist);
public:
	virtual int decreasDist(int node, int newDist);
public:
	virtual int deleteMin(void);
public:
	static void testPHeap(void);
public:
	virtual void initial(void);
public:
	PHeapNode * min;
	int tree_num;
	PHeapNode ** allNodes;
private:
	void meld(PHeapNode * fh);
private:
	void cut(PHeapNode * theNode);
	void two_wayMerge(PHeapNode *);
	
};