Hämta källkodspaketet 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.
|
|
|
| Arkitektur | Paketstorlek | Installerad storlek | Filer |
|---|---|---|---|
| alpha | 183,3 kbyte | 672 kbyte | [filförteckning] |
| amd64 | 170,9 kbyte | 548 kbyte | [filförteckning] |
| arm | 171,7 kbyte | 544 kbyte | [filförteckning] |
| armel | 153,3 kbyte | 496 kbyte | [filförteckning] |
| hppa | 185,6 kbyte | 564 kbyte | [filförteckning] |
| i386 | 163,1 kbyte | 516 kbyte | [filförteckning] |
| ia64 | 216,3 kbyte | 920 kbyte | [filförteckning] |
| mips | 180,0 kbyte | 716 kbyte | [filförteckning] |
| mipsel | 178,9 kbyte | 716 kbyte | [filförteckning] |
| powerpc | 178,6 kbyte | 564 kbyte | [filförteckning] |
| s390 | 161,3 kbyte | 532 kbyte | [filförteckning] |
| sparc | 166,4 kbyte | 536 kbyte | [filförteckning] |