Imuroi lähdekoodipaketti graphthing:
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.
|
|
|
| Arkkitehtuuri | Versio | Paketin koko | Koko asennettuna | Tiedostot |
|---|---|---|---|---|
| alpha | 1.3.2-2 | 183.3 kt | 672 kt | [tiedostoluettelo] |
| amd64 | 1.3.2-2 | 170.9 kt | 548 kt | [tiedostoluettelo] |
| armel | 1.3.2-2 | 153.3 kt | 496 kt | [tiedostoluettelo] |
| hppa | 1.3.2-2 | 185.6 kt | 564 kt | [tiedostoluettelo] |
| hurd-i386 | 1.3.2-2 | 163.0 kt | 512 kt | [tiedostoluettelo] |
| i386 | 1.3.2-2 | 163.1 kt | 516 kt | [tiedostoluettelo] |
| ia64 | 1.3.2-2 | 216.3 kt | 920 kt | [tiedostoluettelo] |
| kfreebsd-amd64 | 1.3.2-2 | 166.2 kt | 494 kt | [tiedostoluettelo] |
| kfreebsd-i386 | 1.3.2-2+b1 | 160.3 kt | 478 kt | [tiedostoluettelo] |
| m68k (epävirallinen siirros) | 1.3.2-1 | 154.2 kt | 488 kt | [tiedostoluettelo] |
| mips | 1.3.2-2 | 180.0 kt | 716 kt | [tiedostoluettelo] |
| mipsel | 1.3.2-2 | 178.9 kt | 716 kt | [tiedostoluettelo] |
| powerpc | 1.3.2-2 | 178.6 kt | 564 kt | [tiedostoluettelo] |
| s390 | 1.3.2-2 | 161.3 kt | 532 kt | [tiedostoluettelo] |
| sparc | 1.3.2-2 | 166.4 kt | 536 kt | [tiedostoluettelo] |