nodearray.h

Dijkstra算法的实现

// NodeArray.h: interface for the CNodeArray class.
//
//////////////////////////////////////////////////////////////////////

#if !defined(AFX_NODEARRAY_H__9FF90A4B_A6F3_422B_A096_4C770B5C1136__INCLUDED_)
#define AFX_NODEARRAY_H__9FF90A4B_A6F3_422B_A096_4C770B5C1136__INCLUDED_

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

#include "SocketComm.h"
#include "Afxtempl.h"


typedef struct tagNodeInfo
{
	UINT	NodeNum;
 	char	ip[16];
	int		Weight;
}NodeInfo,*pNodeInfo;

class CNodeArray  
{
public:
	CNodeArray();
	virtual ~CNodeArray();

public:
	BOOL DelNode(LPCTSTR lpctip);
	BOOL DelNode(UINT num);
	BOOL AddNode(LPCTSTR strip);
 	CArray<NodeInfo,NodeInfo&> m_ArrayNodeInfo;


private:
};

#endif // !defined(AFX_NODEARRAY_H__9FF90A4B_A6F3_422B_A096_4C770B5C1136__INCLUDED_)