-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20
-
21
-
22
-
23
-
24
-
25
-
26
-
27
-
28
-
29
-
30
-
31
-
32
-
33
-
34
-
35
-
36
-
37
-
38
-
39
-
40
-
41
-
42
-
43
-
44
-
45
-
46
-
47
-
48
-
49
-
50
목차
1. 프로그램 디자인
1) Llinked list
...
2) 문자열 처리
....
3) insertion
...
4) 곱셈 구현
...
2. 주요 소스코드 설명
3. 분석
1) Llinked list
...
2) 문자열 처리
....
3) insertion
...
4) 곱셈 구현
...
2. 주요 소스코드 설명
3. 분석
본문내용
.....
typedef struct listNode{
data data;
listNode* headerLink;
listNode* colLink; // downward
listNode* rowLink; // rightward
} listNode;
typedef struct mainHeader{
....
} mainHeader;
void insertHeader(mainHeader* mHeader, int a_header){
// for inserting header
void init(mainHeader* mHeader, int a_sRow, int a_sCol, int a_nElement){
// for setting mainheader.
void insertNode(mainHeader* mHeader,int a_rowIdx,int a_colIdx,int a_value){
// insert a node including row index, column index and value
void transpose(mainHeader* mHeader){
// transpose matrix to multiply
void set(char* token, mainHeader* list){
//store sparse matrix by linked list
.....
typedef struct listNode{
data data;
listNode* headerLink;
listNode* colLink; // downward
listNode* rowLink; // rightward
} listNode;
typedef struct mainHeader{
....
} mainHeader;
void insertHeader(mainHeader* mHeader, int a_header){
// for inserting header
void init(mainHeader* mHeader, int a_sRow, int a_sCol, int a_nElement){
// for setting mainheader.
void insertNode(mainHeader* mHeader,int a_rowIdx,int a_colIdx,int a_value){
// insert a node including row index, column index and value
void transpose(mainHeader* mHeader){
// transpose matrix to multiply
void set(char* token, mainHeader* list){
//store sparse matrix by linked list
.....
소개글