ccrosslist.h

一个用十字链表实现的稀疏矩阵类

#ifndef CROSS_LIST_H_FILE_INLUDED
#define CROSS_LIST_H_FILE_INLUDED

#include <iostream>
#include <vector>
#include <iomanip>
#include <math.h>
#include <fstream>
//#include "iFace_Matrix.h"
using namespace std;
class Element {
public:
	double value;
	int i;
	int j;
	Element* right;
	Element* down;
	Element* left;
	Element* up;
	Element();
	Element(int r, int c, double v);
	
};

class CrossList
{
public:
	int m_r,m_c;
	int m_elements_counter;
	int m_elements_MaxNum;
	CrossList();
	CrossList(const CrossList& motherboard);
	CrossList(int para_r, int para_c);
	~CrossList();
	
	Element **Rheaders;
	Element **CHeaders;   //记录头地址
	Element *m_elements;
	void InsertElement(int i, int j, double v);
	void Print();
	void PrintAll();
//	void SaveAll(CString);
	CrossList operator * (const CrossList & matrix);
	CrossList operator * (const double n);
	CrossList operator / (const double n);
	CrossList operator + (const CrossList & matrix);
	CrossList operator - (const CrossList & matrix);
	CrossList& operator = (const CrossList & matrix);
	double QtbyAbyQ(double* q);
	CrossList Transpose() const;
	CrossList SubAlphak(double alphak);
//	void Lanczos(CString );
//	void Lanczos(iFace_CMatrix *eigenvector, int dim);
//	void ToMatrix(iFace_CMatrix* mx);
	void SubAlphak1(double alphak);
	void Arraydivdouble(double* Array, double n, double* outArray, int sz);
	void RightMultiplyArray(double* inArray, double* out_Array);
	void ArraySubArray(double* inArray1, double* inArray2, double* outArray, int sz);
	double ArrayNorm(double* inArray, int n);
	void CrossListDivDouble(double n);
	double MaxNonnegtiveValue();
};
#endif