Not Rated
Some of the features of GraphThing are:

* Adding, deleting and moving of vertices and edges.
* Loading and saving of graphs.
* Graph complements, induced subgraphs and line graphs.
* Quick creation of many common graphs (complete, cycle, null, star, etc.).
* Determination of shortest path, connectivity and Eulericity.
* BFS, DFS and Minimum Spanning Tree.
* Adjacency matrix (including exponents) and degree sequence.
* Chromatic polynomial and chromatic number.
* Network algorithms: Maximum network flow.

These `graphs' are mathematical objects that describe relationships between sets; they are not 2D plots, charts, or anything similar to that.

At the moment, only simple graphs and digraphs are supported; that is, no multiple edges or loops. Other than this, GraphThing can handle every type of graph.
Interface: Graphical (wxW)
Available deb Repositories (how-to add a respository)
Debian 32-bit 64-bit
stable 1.3.2-3 1.3.2-3
testing 1.3.2-3.1 1.3.2-3.1
sid 1.3.2-3.1 1.3.2-3.1

Ubuntu 32-bit 64-bit
lucid 1.3.2-2 1.3.2-2
precise 1.3.2-3.1 1.3.2-3.1

Rating: Not Rated (0 votes)

Login or Register to rate GraphThing, add a Tag, or designate as an alternative to a Windows app

Upload Screenshots
Images must be in GIF, JPG, or PNG formats and can be no larger than 2 MB. Only one file can be uploaded at a time. A description can be included, but it is optional.
You must login or register to upload a screenshot.
Submit Web Links
Submit the title and link (including http://) to an article pertaining to GraphThing and it will appear in the Web Links section of the right banner. Contact us here if an entry needs to be removed.
You must login or register to post links.

Write a Review

  • Allowed HTML tags: <a> <em> <strong> <cite> <code> <ul> <ol> <li> <dl> <dt> <dd>
  • Lines and paragraphs break automatically.
More information about formatting options