Pigale download

"This is a graphics editor and C + + 's algorithm library in fact."
indir.biz Editor: We develop a graphical editor and C + + library of algorithms, in fact related to planar graphs. Specifically designed for graphics editor theoretical research.

---

Graph data structure built on a new static graphics optimizing topological operations.
Input-output file format Graphml partially implemented.
In addition to providing client / server which provides easy interface with other programs, among other things Pigale () by using a pipe.
library the following new algorithms based on recent theoretical research of our site contains.

---

General Algorithms:
flatness testing and calculation algorithm built Fraysseix right algorithm using Rosenstiehl
(probably the fastest flatness test
a linear time algorithm to find a Kuratowski sub-critical or cotree left a non-planar graph partial subgraph
3-planar graphs for linear time connexity test
3 sub-branches for a linear-time recognition algorithm for maximal planar graph planar graphs
When 4-connected connexity a linear test
depth first search algorithm, a fast (unpublished),
3 speed and routing algorithms, planar graphs on a regular bipolar
planar graphs a linear time-optimal triangulation algorithm by increasing up to 6 degrees due
1.3.11 is now in an algorithm's segmentation Pigale you can make free based on factorial analysis.