dijkstra_tadoc.h

数据结构的经典实验程序。以全国主要城市为图的顶点, 铁路连接为图的边, 距离作为加权, 设计完成一个最短路径自动查找系统；输入为出发城市和目标城市, 输出为最短路径和距离。

// Dijkstra_TADoc.h : interface of the CDijkstra_TADoc class
//
/////////////////////////////////////////////////////////////////////////////

#if !defined(AFX_DIJKSTRA_TADOC_H__80C5A9DB_3491_4138_8314_50F9638FAA6E__INCLUDED_)
#define AFX_DIJKSTRA_TADOC_H__80C5A9DB_3491_4138_8314_50F9638FAA6E__INCLUDED_

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


class CDijkstra_TADoc : public CDocument
{
protected: // create from serialization only
	CDijkstra_TADoc();
	DECLARE_DYNCREATE(CDijkstra_TADoc)

// Attributes
public:

// Operations
public:

// Overrides
	// ClassWizard generated virtual function overrides
	//{{AFX_VIRTUAL(CDijkstra_TADoc)
	public:
	virtual BOOL OnNewDocument();
	virtual void Serialize(CArchive& ar);
	//}}AFX_VIRTUAL

// Implementation
public:
	virtual ~CDijkstra_TADoc();
#ifdef _DEBUG
	virtual void AssertValid() const;
	virtual void Dump(CDumpContext& dc) const;
#endif

protected:

// Generated message map functions
protected:
	//{{AFX_MSG(CDijkstra_TADoc)
		// NOTE - the ClassWizard will add and remove member functions here.
		//    DO NOT EDIT what you see in these blocks of generated code !
	//}}AFX_MSG
	DECLARE_MESSAGE_MAP()
};

/////////////////////////////////////////////////////////////////////////////

//{{AFX_INSERT_LOCATION}}
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.

#endif // !defined(AFX_DIJKSTRA_TADOC_H__80C5A9DB_3491_4138_8314_50F9638FAA6E__INCLUDED_)