It aims to become a full-featured computer algebra
system (CAS) while keeping the code as simple as
possible in order to be comprehensible and easily
extensible. SymPy is written entirely in Python and
does not require any external libraries.
WWW: http://code.google.com/p/sympy/
PR: ports/126394
Submitted by: Wen Heping <wenheping at gmail.com>
for FreeBSD. The official KDE 4.1.0 release notes can be found at
http://www.kde.org/announcements/4.1/.
Some note:
* Prefix
KDE4 will be install into a custom prefixes namely ${LOCALBASE}/kde4.
KDE4 and KDE3 can co-exist
* Sound
For sound to work, it is necessary to have dbus and hal enabled
in your system. Please see the respective documentation on how
to enable these.
For more Informations see the HEADS UP at ports@ and kde-freebsd@
or our wiki page http://wiki.freebsd.org/KDE4/Install.
Have fun!
It was created because of an article/challenge in "The Perl Review"
WWW: http://search.cpan.org/dist/Math-Base36/
PR: ports/126383
Submitted by: Yi-Hsuan Hsin <mhsin at mhsin.org>
matrices. It is built as a set of generic algorithms (mult, add,
copy, sub-matrices, dense and sparse solvers ...) for any interfaced
vector type or matrix type. It can be view as a glue library allowing
cooperation between several vector and matrix types. However, basic
sparse, dense and skyline matrix/vector types are built in Gmm++,
hence it can be used as a standalone linear algebra library.
Interfacing a vector or matrix type means writing "traits" objects
called "linalg_traits", which describe their properties. The library
offers predefined dense, sparse and skyline matrix types.
WWW: http://home.gna.org/getfem/
A C-coded Python extension module that wraps the GMP library to provide
to Python code fast multiprecision arithmetic (integer, rational, and
float), random number generation, advanced number-theoretical functions,
and more.
WWW: http://code.google.com/p/gmpy/
undirected and directed graphs. It includes implementations for
classic graph theory problems like minimum spanning trees and
network flow, and also implements algorithms for some recent
network analysis methods, like community structure search.
igraph contains functions for generating regular and random graphs,
manipulating graphs, assigning attributes to vertices and edges.
It can calculate various structural properties, includes heuristics
for community structure detection, supports many file formats.
WWW: http://cneurocvs.rmki.kfki.hu/igraph/
PR: ports/125534
Submitted by: Wen Heping <wenheping at gmail.com>
