<html><head><style type="text/css"><!-- DIV {margin:0px;} --></style></head><body><div style="font-family:times new roman, new york, times, serif;font-size:12pt"><div style="font-family: times new roman,new york,times,serif; font-size: 12pt;">Hello Alex,<br><br>Thanks for the script. I will take a look at it soon.<br><br>At some point the graph theoretic part of my project will involve graph isomorphism, and generating all unlabeled graphs from some classes of graphs, generating random objects from various classes, ... and computing various polynomial invariants. Also, at the moment all I know is C (and some C++), so I will probably go ahead and give a try to C+++GiNaC. But I am definitely interested in looking at your script since there is also another open source project in python (called SAGE - software for algebra and geometry experimentation), and some of what I want to do may be possible in SAGE.<br><br>Thanks to all of you who responded
promptly.<br><br>Regards,<br><br>Bhalchandra Thatte<br><br>Alfréd Rényi Institute of Mathematics<br>Budapest<br><br><br><div style="font-family: times new roman,new york,times,serif; font-size: 12pt;">----- Original Message ----<br>From: alexander baker <baker.alexander@gmail.com><br>To: GiNaC discussion list <ginac-list@ginac.de><br>Cc: Bhalchandra Thatte <bdthatte@yahoo.com><br>Sent: Friday, May 23, 2008 11:12:35 AM<br>Subject: Re: [GiNaC-list] advice on a GiNaC based project.<br><br>I agree with Alexei, here is a similar example that I put together some time ago using Python, perhaps a high level script would be a better tool for the job!<br><br>Enjoy.<br><br>Alex<br><br><a rel="nofollow" target="_blank" href="http://www.alexfb.com/cgi-bin/twiki/view/PtPhysics/Adjacency-Matrix-EigenVectore-Path-Graph">http://www.alexfb.com/cgi-bin/twiki/view/PtPhysics/Adjacency-Matrix-EigenVectore-Path-Graph</a><br><br><div
class="gmail_quote">2008/5/23 Alexei Sheplyakov <<a rel="nofollow" ymailto="mailto:varg@theor.jinr.ru" target="_blank" href="mailto:varg@theor.jinr.ru">varg@theor.jinr.ru</a>>:<br><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
Hello!<br><div class="Ih2E3d"><br>
On Fri, May 23, 2008 at 12:47:55AM -0700, Bhalchandra Thatte wrote:<br><br>
> I wish to write a few programs that do something like this:<br>
> take a graph or a tree<br>
> each vertex or edge of the graph has a variable associated with it.<br>
> walk on the graph or find certain subgraphs, and compute certain<br>
> multivariable polynomials in terms of the variables associated<br>
> with vertices or edges.<br><br></div>I think boost.graph (for graph manipulations) and GiNaC (for symbolic<br>
computation) is a reasonable choice.<br><div class="Ih2E3d"><br>
> later possibly do numerical optimization of the polynomials using<br>
> an optimization library.<br><br></div>Be forewarned: GiNaC does not provide any kind of numerical optimization.<br><div class="Ih2E3d"><br>
> I thought GiNaC would be ideal for this type of applications because<br>
> C++ will give me complete control over the data structures and<br>
> the efficiency.<br><br></div>I suggest to think twice if you really need a low level programming<br>
language (such as C++) at all.<br><br>
Best regards,<br>
Alexei<br><font color="#888888"><br>
--<br></font><div><div></div><div class="Wj3C7c">All science is either physics or stamp collecting.<br><br></div></div><br>-----BEGIN PGP SIGNATURE-----<br>
Version: GnuPG v1.4.6 (GNU/Linux)<br><br>
iQIVAwUBSDaEzyXMWnuYxRVqAQL7XxAAok3ywm5yWWvGwSOI/XMCIE3Y7j23Q9td<br>
DH8TEX5hIt1kzASA33iaDsWVkvBPRyWPGTF6AJLOvnyOLX1LHcB0Q8F+ojfKmVIw<br>
o2raKOltLYO4oDB8K/edUtfLlUrLv7r688t6qdBBzDmxfbMQ/4/W32hioMvzr9yh<br>
isWgXIjBV/FV86D2hVF/q7PvbloulHVyxH3TwINkmyItaygfToaS5OyDJVdBeKbv<br>
SJ0gbqEKNkyWZ/4ZIZeJ0ckkOhP/fIDGO04YqVKrLUwy7Q1UZuuti3i92Vosr+Yb<br>
m7x7v5yZk0J/3W/S1x+ZOl/1tt8UVacAc9maIlQXM9kH0B8wG7vQCHHNKZ6XzHtN<br>
krUxNxw7ciWz4WY0tXg2vzePzMCzVN3nfaWLJ9Fznt3VPPDYuFfWQmsS7zPXXOS9<br>
nHkmM9pSZ4wR8nLDZAmIH36J9QMmImx9d/T91na3tAhKm1/4Q/3uO1SLHahIgCcj<br>
dYkA8F1GWR082XlBqnWoISwlJjv1ZqNFsjISllixYk24+MvtODHohDEJnEUsAoWg<br>
jdol4XxpZS3UAGa+Cy7xpzC1iOpksEmG/3zQaI9QUI8GXdnXfM1noeAGDnH/JeF8<br>
aEsu5Z6Wva3iZYBFj3SM/mnFqleumt6Jf4YBMDYiohQG5RoQCtQ4k/DjSED1JZiP<br>
gx4tfNdbA9A=<br>
=HgPN<br>
-----END PGP SIGNATURE-----<br><br>_______________________________________________<br>
GiNaC-list mailing list<br><a rel="nofollow" ymailto="mailto:GiNaC-list@ginac.de" target="_blank" href="mailto:GiNaC-list@ginac.de">GiNaC-list@ginac.de</a><br><a rel="nofollow" target="_blank" href="https://www.cebix.net/mailman/listinfo/ginac-list">https://www.cebix.net/mailman/listinfo/ginac-list</a><br><br></blockquote></div><br><br clear="all"><br>-- <br>Mobile: 07788 872118<br>Blog: <a rel="nofollow" target="_blank" href="http://www.alexfb.com">www.alexfb.com</a><br><br>--<br>All science is either physics or stamp collecting.
</div></div></div><br>
</body></html>