矩阵（十字链表）

 就做了创建，加法还有输出，减法与加法类似``

 

3. #include<iostream>
4. #include<malloc.h>
5. using namespace std;
7. #define OK 1
8. #define ERROR 0
9. #define OVERFLOW -2
10. typedef int Status;
12. typedef struct OLNode{
13.         int i,j;
14.         int e;
15.         struct OLNode *right,*down;
16.         }OLNode,*OLink;
18. typedef struct{
19.         OLink *rhead,*chead;
20.         int mu,nu,tu;
21.         }CrossList;
22.         
23. Status CreateSMatrix_OL(CrossList &M){
24.       cin>>M.mu>>M.nu>>M.tu;
25.       M.rhead=(OLink*)malloc((M.mu+1)*sizeof(OLink));
26.       M.chead=(OLink*)malloc((M.nu+1)*sizeof(OLink));
27.       if(!M.rhead||!M.chead) return ERROR;
28.       int k=1,i,j,e;
29.       OLink p,q;
30.       for(;k<=M.mu;k++)
31.               M.rhead[k]=NULL;
32.       for(k=1;k<=M.nu;k++)
33.               M.chead[k]=NULL;        
34.       k=0;
35.       while(k<M.tu)
36.       {
37.          cin>>i>>j>>e;
38.          p=(OLink)malloc(sizeof(OLNode));
39.          if (!p) return ERROR;
40.          p->i=i;p->j=j;p->e=e;  p->down=NULL;  p->right=NULL;
41.          if(M.rhead[i]==NULL||M.rhead[i]->j>j){
42.           p->right=M.rhead[i];
43.           M.rhead[i]=p;} 
44.          else {
45.              for(q=M.rhead[i];(q->right)&&(q->right->j<j);q=q->right);
46.              p->right=q->right;q->right=p;}
47.          if(M.chead[j]==NULL||M.chead[j]->i>i){
48.           p->down=M.chead[j];
49.           M.chead[j]=p;} 
50.          else {
51.              for(q=M.chead[j];(q->down)&&q->down->i<i;q=q->down);
52.              p->down=q->down;q->down=p;}
53.         k++;      }
54.          return OK; }
56. Status AddSMatrix_OL(CrossList &A,CrossList &B){
57.        if(!(A.mu==B.mu&&A.nu==B.nu)) return ERROR;
58.        OLink pa,pb,pre,pp;
59.        for(int row=1;row<=A.mu;row++)
60.        for(pre=NULL,pa=A.rhead[row],pb=B.rhead[row];pb;)
61.        {
62.               if(pa==NULL||pa->j>pb->j){
63.                                         if(!pre) 
64.                                              {A.rhead[row]=pb;pb->right=pa;pa=pb;}
65.                                         else 
66.                                              {pre->right=pb; pb->right=pa;}                        
67.                                         
68.                                         if(!A.chead[pb->j]||A.chead[pb->j]->i>pb->i) { pb->down=A.chead[pb->j];A.chead[pb->j]=pb;}
69.                                         else {
70.                                              for(pp=A.chead[pb->j];(pp->down)&&(pp->down->i<pb->i);pp=pp->down);
71.                                              pb->down=pp->down;pp->down=pb;}
72.                                       if(!pa){ pre=pa;pa=pa->right;}
73.                                                 pb=pb->right;   }
74.              else if(pa->j < pb->j)   {pre=pa;pa=pa->right;}
75.              else  {
76.                                     int sum=pa->e+pb->e;
77.                                     if(sum) {pa->e=sum;pre=pa;}
78.                                     else {
79.                                          pre->right=pa->right;
80.                                          for(pp=A.chead[pa->j];pp->down&&(pp->down->i)<pa->j;pp=pp->down);
81.                                             pp->down=pa->down;
82.                                          }
83.                                          pa=pa->right;
84.                                          pb=pb->right;        }
85.        }
86.        return OK;
87.        }
88. void Print(CrossList A)
89. {
90.      int col;
91.      for(int row=1;row<=A.mu;row++)
92.      {
93.             col=1;
94.             for(OLink pa=A.rhead[row];pa;pa=pa->right)
95.             { while(col<pa->j)
96.                  {
97.                     cout<<"0"<<" ";
98.                     col++; } 
99.             cout<<pa->e<<" ";col++;}
100.             
101.             while(col<=A.nu)
102.             {
103.             cout<<"0"<<" ";
104.             col++;}
105.             cout<<endl;    
106.             }
107. }
110. int main()
111. {
112.    CrossList A,B;
113.    
114.    CreateSMatrix_OL(A);
115.    Print(A);
116.    
117.    CreateSMatrix_OL(B);
118.    Print(B);
119.    
120.    AddSMatrix_OL(A,B);
121.    Print(A);
122.    
123.    return 0;}