picture.h

数据结构中的图最短路径问题

// Picture.h: interface for the CPicture class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_PICTURE_H__FD3CAAE2_16D7_41DC_8C7C_26E0E29F6634__INCLUDED_)
#define AFX_PICTURE_H__FD3CAAE2_16D7_41DC_8C7C_26E0E29F6634__INCLUDED_

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

typedef struct _PICTURENODE{
	bool flage;
	char letter;
}PICTURENODE;

typedef struct _PICTURELINE{
	int number;
}PICTURELINE;

typedef struct _PICTURESHORT{
	int position;
	int length;
	int parent;
	int count;
}PICTURESHORT;
 
class CPicture  
{
public:
	enum{MAX=10,MAXVALUE=1000};
	CPicture();
	virtual ~CPicture();
	bool Create(int nSize =5);
	bool Random();
	bool SetEdge(int nStarNode,int nEndNode,PICTURELINE nValue);
	bool GetEdge(int nStarNode,int nEndNode,PICTURELINE &nValue);
	bool Perform(int nStarNode =-1);
	bool Show(CDC * pDC,CRect * pRect);
	bool Destroy();
	
private:
	PICTURENODE * m_pData;//结点
	PICTURELINE (* m_npTable)[MAX];//边
	PICTURESHORT * m_pShort;
	int m_nSize;
	int m_nFind;
};

#endif // !defined(AFX_PICTURE_H__FD3CAAE2_16D7_41DC_8C7C_26E0E29F6634__INCLUDED_)