crosslist.h

数据结构中关于十字链表的实现

#ifndef CORRSLIST_H
#define CORSSlIST_H

//十字链表结点结构
struct OLNode
{
	int row;
	int column;
	int data;
	OLNode *right,*down;
};
typedef OLNode *OLink;
class CrossList
{
private:
	OLink   * m_rowHead;
	OLink   * m_colHead;
	int       m_rowNum;
	int       m_colNum;
	int       m_Count;
public:
	CrossList();
	~CrossList();

    void      CreateCrossList(const int rowNum,const int colNum,int array[][100]);
	void      AddNode(const int rowIndex,const int colIndex,const int data);
	OLNode  * GetOLNode(const int rowIndex,const int colIndex);
	void      Destroy();
    void      InsertNode(int rowIndex,int colIndex,int value);
	void      Print();
    int       GetDataNum() {return m_Count;}
	int       GetRowNum()  {return m_rowNum;}
	int       GetColNum()  {return m_colNum;}
};

#endif