Windows | Games | Mobile | Wallpapers


Graph Magics 2.1

Graph Magics - an ultimate tool for Graph Theory.


Buy now !$65.00

Last Week downloads: 0
Total downloads: 483
  • Last Updated: Oct 25, 2009
  • License: Shareware $65.00 Buy
  • OS: Windows 2003/XP/2000/98/Me/NT
  • Requirements: Microsoft .NET Framework v1.1 ; 64MB RAM (128MB recommended) ; 500Mhz processor

User reviews

0 out of 5 based on 0 ratings for Graph Magics 2.1

For Graph Magics 2.1Publisher's description


Graph Magics is a Home & Education software developed by Dumitru Ciubatii. After our trial and test, the software is proved to be official, secure and free. Here is the official description for Graph Magics:

EditByBrothersoft: Graph Magics - an ultimate tool for Graph Theory. Containing a numerous collection of functions, utilities and algorithms, it offers you the possibility of easy, fast and efficient construction, modification and Analysis of graphs.

Some of its major features are:
1. Easy construction and nice representation of graphs.
2. More than 15 different algorithms that one can apply to graphs (ex. Shortest Path, Maximum Flow, Minimum Cut, Maximum Clique, Maximal Subset of Independent Vertices, Eulerian Path/Circuit, Hamiltonian Path/Circuit, Chinese Postman Problem, Graph Center, Graph Median etc.).
3. 4 different graph layouts (and 5 different vertices shapes).
4. A powerful graph generator tool.
5. Many other useful things like: graph importation and exportation, matrix representation of graphs, zoom, undo/redo, Copy/paste etc.

Graph Magics can be used in practice (economics, social sciences, urban operations and others); for studying, analyzing and solving problems on graphs; for teaching graph theory; for constructing and designing graphs; and for many other things.Functions for arranging graphs in Circle, tree, grid, bipartite graphs are offered.
you can free download Graph Magics 2.1 now.

For Graph Magics 2.1Related Software


Please be aware that Brothersoft do not supply any crack, patches, serial numbers or keygen for Graph Magics,and please consult directly with program authors for any problem with Graph Magics.