GraphThing icon

GraphThing

2 big stars
GraphThing screenshot
Name: GraphThing
Works on: windowsWindows XP and above
Developer: David Symonds
Version: 1.3
Last Updated: 19 Feb 2017
Release: 08 Jul 2007
Category: Multimedia > Graphic
Rate this software:
215 downloads
commentsComments
downloadDownload
Liked it? Tell others:
details

GraphThing Details

Works on: Windows 10 | Windows 8.1 | Windows 8 | Windows 7 | Windows XP | Windows 2000 | Windows 2003 | Windows 2008 | Windows Vista | Windows 2012
SHA1 Hash: 065779705a64acf5acac22b339e8e87e8e210d85
Size: 1.1 MB
File Format: zip
Rating: 2.217391304 out of 5 based on 23 user ratings
Publisher Website: External Link
Downloads: 215
License: Free
GraphThing is a free software by David Symonds and works on Windows 10, Windows 8.1, Windows 8, Windows 7, Windows XP, Windows 2000, Windows 2003, Windows 2008, Windows Vista, Windows 2012.
You can download GraphThing which is 1.1 MB in size and belongs to the software category Graphic.
GraphThing was released on 2007-07-08 and last updated on our database on 2017-02-19 and is currently at version 1.3.
download button
Thank you for downloading from SoftPaz! Your download should start any moment now. It would be great if you could rate and share:
Rate this software:
Share in your network:
features

GraphThing Description

These "graphs" are mathematical objects (look at this introduction to Graph Theory) that describe relationships between sets; they are not charts, 2D plots, or anything similar to these.

What can GraphThing do?

At the moment, only support for simple graphs and digraphs are supported; that is, no multiple edges or loops. Other than this, GraphThing can handle every type of graph.
Here are some key features of "GraphThing":
ï¿­ 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.
similarSimilar Software