C++ 的一些免费库

//整理 by RobinKin (王亮)
  • Linear Algebra
    • MTL, the Matrix Template Library. Dense and sparse matrices and vectors; banded, symmetric, triangular matrices; basic algorithms. C++.

               矩阵模版库,紧密和稀疏矩阵、矢量,带状,对称、三角矩阵,基本算法(C++语言)

    • uBLAS, BLAS in C++ with expression templates.

                表达式模版形式的 C++中的BLAS ,

    • tvmet, a C++ library for "tiny" vectors and matrices with expression templates.

                小型矢量和矩阵的表达式模版

    • GMM++, generic C++ template library for sparse, dense and skyline matrices, with solvers from ITL.
    • MET, a C++ matrix library with expression templates, which eliminates the overhead of overloaded operators.
    • SL++, the Scientific Library project. Will provide matrices, random numbers, complex, quaternions, plotting, and FFTs. C++.

               科学计算库,提供矩阵、随机数、复数、四元数,快速复利叶变换(C++语言)

    • Seldon, C++ library for linear algebra with BLAS interface. Many matrix types (sparse, symmetric, hermitian, etc.) are supported.

                BLAS 线性代数接口,支持 稀疏,对称,共轭矩阵

    • ALP, linear and polynomial algebra. Vectors, matrices, polynomials.
    • SVMT: E. Robert Tisdale's proposal for a standard C++ Scalar, Vector, Matrix and Tensor Class Library (with implementation). Note: this is a proposal, not an official standard.
    • GNUSSL [ftp only], the GNU Scientific Software Library. Linear algebra and arrays. C++.
    • CPPLapack, C++ wrapper for BLAS and LAPACK.
    • Lapack++, C++ wrapper for BLAS and LAPACK.
    • IML++ A C++ template library for numerical iterative methods.
    • MV++ Numerical Matrix/Vector Classes in C++
    • SparseLib++ A library for sparse matrix computations, including the Sparse BLAS (Basic Linear Algebra Subprograms). C++.
    • ISIS++, an object-oriented framework for solving sparse linear systems of equations. C++.
    • ARPACK++, a C++ template library for solving large-scale standard and generalized eigenvalue problems.
    • The Template Numerical Toolkit (TNT) for linear algebra is a successor to the Lapack++, Sparselib++, IML++, and MV++ packages. Its goal is to integrate these ideas into a generic algorithmic library, supporting generic user-defined data types, and increasing its functionality. C++.
    • LinAlg, basic linear algebra and optimization classes. C++.
    • CAM C++ Class Library (Matrix, vector, and graphics classes)
    • Newmat, a C++ matrix library (docs, download)
    • CLHEP includes matrix classes, random number generators for the High Energy Physics (HEP) community. C++.
    • BPKIT, Block Preconditioning Toolkit for iterative solution of linear systems. Callable from C++, C, or FORTRAN.

  • Arrays and Images
    • POOMA II framework for scientific computing on sequential and parallel computers. Provides parallel arrays; fields, meshes, particles to come in version 2.1 (June 1999). C++.
    • The Blitz++ class library: Array and Vector classes which rival Fortran's performance. C++.
    • The AIPS++ Array and Image Classes (Astronomical Information Processing System). C++.
    • Daixtrose, a general-purpose expression template engine.
    • PETE, an expression templates library -- add expression templates to your own array class.
    • SCTL (BlueSail), C++, arrays, matrics, vectors, sparse, rotations.  
    • VIGRA, generic computer vision/image processing library.
    • CPPIMA A C++ image processing library
  • 0
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
#include"iostream" #include"string" #include<iomanip> #include<fstream> using namespace std; typedef int Status; typedef int ElemType; #define OK 1 #define ERROR 0 typedef struct LNode//定义 { ElemType data;//结点的数据域 struct LNode *next;//结点的指针域 }LNode,*LinkList; //LinkList为结构体LNode的指针类型 Status InitList(LinkList &L)//初始 { L=new LNode; L->next=NULL; return OK; } void GreateList_L(LinkList &L,int n)//后插法 输入元素 { /*L=new LNode;//生成新的结点作为头结点,用头指针L指向头结点 L->next=NULL;//头结点的指针域为空*/ LNode *r; LNode *p; r=L; //!!!!错误,定义指针 for(int i=0;i<n;++i) { p=new LNode; cin>>p->data; p->next=NULL; r->next=p; r=p; } } /*void CreateList_L(LinkList &L,int n)//前插法 { cout<<"输入录取数据个数 "; cin>>n; cout<<"输入数据"; L=new LNode;//生成新的结点作为头结点,用头指针L指向头结点 L->next=NULL;//头结点的指针域为空 for(int i=0;i<n;++i) { p=new LNode; cin>>p->data; p->next=L->next; L->next=p; } }*/ Status GetElem(LinkList L,int i,int &e)//取值 { LNode *p; p=L->next;int j=1; while(p&&j<i) { p=p->next; ++j; } if(!p||j>i) return ERROR; e=p->data; return OK; } LNode *LocateElem(LinkList L,ElemType e)//查找 { int j=1; LNode *p; p=L->next; while(p&&p->data!=e) { p=p->next; } return p; } Status LisInsert(LinkList &L,int i,ElemType e)//插入 { LNode *p; p=L->next;int j=0; while(p&&(j<i-1)) { p=p->next; j++; } if(!p&&(j>i-1)) return ERROR; LNode *s; s=new LNode; s->data=e; s->next=p->next; p->next=s; return OK; } Status ListDelete(LinkList &L,int i)//删除 { LNode *p; p=L->next;int j=0; while(p&&(j<i-1)) { p=p->next; j++; } if(!(p->next)&&(j>i-1)) return ERROR; LNode *q; q=p->next; p->next=q->next; delete q; return OK; } int main() { LNode *L; int i,temp,n,choose=-1; int e; cout << "1. 创建信息表\n"; cout << "2. 查找元素\n"; cout << "3. 插入元素\n"; cout << "4. 删除元素\n"; cout << "0. 退出程序\n\n"; while(choose!=0) { cout << "请选择:"; cin >> choose; switch (choose) { case 1: cout<<"请输入元素个数:"; cin>>n; cout<<"\n"<<"请输入元素"; GreateList_L(L,n); cout<<"\n"; break; case 2:cout<<"请输入查找的元素:"; cin>>e; LNode *s; s=LocateElem(L,e); cout<<"这个元素的地址是"<<s<<"\n\n"; break; case 3:cout<<"请输入需要插入的数:"; cin>>e; cout<<"\n"<<"请输入需要插入的位置"; cin>>i; if(LisInsert(L,i,e)) cout<<"插入成功\n\n"; else cout<<"插入失败\n\n"; break; case 4: cout<<"请输入删除的位置:"; cin>>i; if(ListDelete(L,i)) cout<<"删除成功\n\n"; else cout<<"删除失败\n\n"; break; } } }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值