Description: With the order form and has a head node is a single linked list storage structure, sparse matrix to achieve the creation, destruction, copy, transpose, and two matrix addition, subtraction, multiplication operations. Should first enter the matrix of rows and columns, and the number of non-zero element and determine the matrix given the row, the number of columns required for the operation for the match.
To Search:
File list (Check if you may need any files):
稀疏矩阵\源代码\ADT.c
........\......\main.c
........\......\Matrix.h
........\......\User_Menu.c
........\源代码
稀疏矩阵
Download