graph.h

这是由Dijkstra算法实现的最短路径的实现

#pragma once

#include <vector>

class CGraphNode
{
public:
	CGraphNode(void);
	~CGraphNode(void);
	//节点坐标
	CPoint m_Pos;
	//邻接表
	std::vector<int>	m_Adj;
    // int m_Adj[];
	int AddAdjNode(int nNode);


	BOOL m_bSelected;
	std::vector<int>	m_SelectAdj;

	int ClearSelect(void);
	int SelectEdge(int nNode);
	
};

class CGraph
{
public:
	int Cost (  int j,int k);
	CGraph(void);
	virtual ~CGraph(void);

	std::vector< CGraphNode >	m_Nodes;//定义结点数组
	void clear(void);
	int AddNode(CPoint Pos);
	void Draw(CDC * pDC);

	int GetNodeIndex(CPoint Pos);      //输入点的位置，输出节点的序号
	void AddEdge(int nStart, int nEnd);  //nStart,nEnd是有GetNodeIndex传递过来
	
	CRect GetNodeRect(int nNode);
	int ClearSelect(void);
	int ShortestPath(int v,int vd);
	CString Save(void);
	int Load(CString sGraph);
	int Prim(void);
};