Hi, Bhalchandra Thatte schrieb:
I wish to write a few programs that do something like this: take a graph or a tree each vertex or edge of the graph has a variable associated with it. walk on the graph or find certain subgraphs, and compute certain multivariable polynomials in terms of the variables associated with vertices or edges. later possibly do numerical optimization of the polynomials using an optimization library. I thought GiNaC would be ideal for this type of applications because C++ will give me complete control over the data structures and the efficiency. But could someone comment if GiNaC is not the right choice?
yes, C++ with GiNaC is a good choice for that (I programed similar stuff already). BUT: for the optimization you will maybe miss polynomial factorization. Polynomial factorization is not available in GiNaC. Regards, Jens