A minor upgrade of Graph Magics has now been published. It offers the possibility to view graph representation and data at the same time in 2 horizontally split windows. Chinese Postman Problem algorithm now works on any type of graphs. On mixed graphs it runs much faster than other known algorithms.
Besides that some small bugs have been removed and the GUI has been improved.
Download it now.

At last the second version of Graph Magics has been published. It is much more powerful than the first version, having more tools and possibilities.
Click here to find out more.

See it now.

See it now.

A Gallery containing a small collection of images of graphs created using this software has been added to the site. There you can mainly see different applied algorithms and the ease with which graphs are built in Graph Magics.
See it now.

A new major version of Graph Magics is going to be published soon.

It will contain many new possibilities, among which: loops (self-edges), edges' flow capacities, a table for editing weights and capacities values, brief algorithms' descriptions, algorithms' results written as text, grid layout, zoom tool, cut/copy/paste, and others.

There will be also added 11 new algorithms to already existing 6; among them are network flows, minimum cut, eulerian and hamiltonian paths, and others.