length.h

可以求的网络的最短路径,直径,介数

#if !defined(AFX_LENGTH_H__6D78A952_A0FE_4D13_BFFE_3DF6966782A2__INCLUDED_)
#define AFX_LENGTH_H__6D78A952_A0FE_4D13_BFFE_3DF6966782A2__INCLUDED_

#if _MSC_VER > 1000
#pragma once
#endif // _MSC_VER > 1000
// Length.h : header file
//

/////////////////////////////////////////////////////////////////////////////
// CLength document
# include <vector>
using   namespace   std; 


const int MAX=17432;
const int MAXX=5000;

struct path_node
{
	int father;
	int length;
	int node_id;
	int flag;
};

struct node
{
	node *next;//链表指针
	int length;//第I个节点到该节点的最短路
	int node_id;//该节点的在有向网络中的序号
};
 struct adjnode
 {
	int reader_number;
	//float linkweight;
	struct adjnode * next;
 };
  struct author
  {
	  int nodenumber;
	  int degree;
	  adjnode * next1;
  };
 

class CLength : public CDocument
{
protected:
	DECLARE_DYNCREATE(CLength)

// Attributes
public:
	CLength();           // protected constructor used by dynamic creation

// Operations
public:

// Overrides
	// ClassWizard generated virtual function overrides
	//{{AFX_VIRTUAL(CLength)
	public:
	virtual void Serialize(CArchive& ar);   // overridden for document i/o
	protected:
	virtual BOOL OnNewDocument();
	//}}AFX_VIRTUAL

// Implementation
public:
	void betweenness();
	void O_data();
	void c_length();
	void readdata();
	void c();
	double length_number;
	double total_length;
	double a_length;
	int  vex_GShu[MAX+1];
	int max;
	vector<path_node> vec1;
	int ** array;
	virtual ~CLength();
	
#ifdef _DEBUG
	virtual void AssertValid() const;
	virtual void Dump(CDumpContext& dc) const;
#endif

	// Generated message map functions
protected:
	//{{AFX_MSG(CLength)
		// NOTE - the ClassWizard will add and remove member functions here.
	//}}AFX_MSG
	DECLARE_MESSAGE_MAP()
};

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

#endif // !defined(AFX_LENGTH_H__6D78A952_A0FE_4D13_BFFE_3DF6966782A2__INCLUDED_)