几个有用的C++算法库

G A lib

A C++ Library of Genetic Algorithm Components

http://lancet.mit.edu/ga/

 

CGAL

geometric algorithms C++ library

http://www.cgal.org/

InstallationManual5页列举了关联引用的开源库,如Boost等。

 

PIGALE

Public Implementation of a Graph Algorithm Library and Editor

http://pigale.sourceforge.net/

 

TAUCS

TAUCS is a C library of sparse linear solvers.(Matrix Abouts)

http://www.tau.ac.il/~stoledo/taucs/

 

GMP

GNU Multiple Precision Arithmetic Library, the fastest bignum library on the planet!

http://www.swox.com/gmp/

 

MPFR

MPFR library is a C library for multiple-precision floating-point computations with exact rounding (also called correct rounding). It is based on the GMP multiple-precision library.

http://www.mpfr.org/

 

LEDA

LEDA is our C++ class library of efficient data types and algorithms. LEDA provides algorithmic know-how in the 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
LEDA是一个商业化的算法函数,LEDA就是Library of Efficient Data structure and Algorithm一个常用ADT的C++实现,推荐下载。简介:LEDA is a library of the data types and algorithms of combinatorial computing. The main features are: LEDA provides a sizable collection of data types and algorithms in a form which allows them to be used by non-experts. In the current version, this collection includes most of the data types and algorithms described in the text books of the area. LEDA gives a precise and readable specification for each of the data types and algorithms mentioned above. The specifications are short (typically, not more than a page), general (so as to allow several implementations), and abstract (so as to hide all details of the implementation). For many efficient data structures access by position is important. In LEDA, we use an item concept to cast positions into an abstract form. We mention that most of the specifications given in the LEDA manual use this concept, i.e., the concept is adequate for the description of many data types. LEDA contains efficient implementations for each of the data types, e.g., Fibonacci heaps for priority queues, red-black trees and dynamic perfect hashing for dictionaries, ... LEDA contains a comfortable data type graph. It offers the standard iterations such as ``for all nodes v of a graph G do'' or ``for all neighbors w of v do'', it allows to add and delete vertices and edges, it offers arrays and matrices indexed by nodes and edges,... The data type graph allows to write programs for graph problems in a form close to the typical text book presentation. LEDA is implemented by a C++ class library. It can be used with almost any C++ compiler (g++, CC, xlC, cxx, Borland, MSVC++, Watcom). LEDA is not in the public domain, but can be used freely for academic research and teaching. A commercial license is also available.

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值