A new view mode is added. Now you can view graph representation and data at the same time in 2 horizontally split windows.

Chinese Postman Problem now works on any type of graph! The speed with which it finds solutions for mixed graphs
is considerably faster than other known algorithms, and you will probably not even find another program that
solves MCPP.

Containing a numerous collection of functions and utilities
it offers you the possibility of easy, fast and efficient construction
and modification of graphs.

Some of the best things of this program are the graph
generator tool and the possibility to process
17 different algorithms
on graphs (Shortest Path, Minimal Spanning Tree, Maximum Flow,
Minimum Cut, Eulerian and Hamiltonian Paths, Chinese Postman Problem, Maximal Subset of Independent Vertices, Maximum Clique
and others).

Graph Magics may be used for many different purposes: graph construction,
solving problems, learning and teaching subjects related to graph
theory etc.