三元组实现稀疏矩阵加减乘(国外英语资料).docVIP

三元组实现稀疏矩阵加减乘(国外英语资料).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
三元组实现稀疏矩阵加减乘(国外英语资料)

三元组实现稀疏矩阵加减乘(国外英语资料) # include stdio, h # include stdlib. H # define MAXSIZE 12500 / / triple structure Typedef struct { Int I, j; / / matrix row index and column index Int e; / / value } Triple; / / matrix structure Typedef struct { Triple data [MAXSIZE + 1]; Int rpos [MAXSIZE + 1]; / / this is where the first non-zero element is in the matrix Int mu, nu, tu; The number of rows, the number of columns, the number of non-zero elements } Matrix; Void Init (Matrix * M); Void Add (Matrix * M, Matrix * T, Matrix * G); (Matrix * M, Matrix * T, Matrix * G); (Matrix * M, Matrix * T, Matrix * G); (Matrix * M, Matrix * T, Matrix * G); Void PrintMatrix (Matrix * M); / / 2, the initialization matrix Void Init (Matrix * M) { Int I; If (m- mu 1 | | m- nu 1 | | M - tu - M - mu * M - nu) { Printf ( error! \ n ); / / if the number of rows in the matrix, the number of columns does not meet the requirements, the printer is wrong } For (I = 1; I = M - tu; I + +) / / data [0] { Printf ( first % d non-zero dollar line number: ); / / this is the data initialization Scanf ( % d, ). Printf ( first % d non-zero column number: ); Scanf ( % d, ). Printf ( the element value of the % d non-zero element: ); Scanf ( % d ). } Printf ( \ n ); Printf ( the matrix you created is as follows: \ n ); PrintMatrix (M); } / / 3, matrix addition Void Add (Matrix * M, Matrix * T, Matrix * G) { So G minus mu is equal to M minus mu. / / because the plus and minus operations have to be equal to the dimension, M, T rows, and column Numbers are the same, initializing the rows and columns of the third party matrix. So G minus nu is equal to M minus nu. G minus tu = 0; Int g, m, t; / / g, m, and t record the location of the elements of the three matrices G = m = t = 1; / / start with data [1] Int k; Int sum; / / and If (m- mu! = T - mu | |. = T - nu! = T - nu) { Printf ( the number of dimensions! \ n ); } (k = 1; k = M - mu; + +) { / / the corresponding elements of the subscript and subscript a

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档