License: Freeware
Downloads: 1
Op. System: Windows XP/2000/98
Last updated: 2009-06-23
File size: 7.92 MB
Publisher: Hubert de Fraysseix&Patrice Ossona de Mendez

Publisher description for Pigale

Pigale program icon

We develop a graph editor and a C++ Algorithm Library essentially concerned with planar graphs. The editor is particularly intended for graph theoretical research. It is built over a new graph data structure optimizing topological operations on Static graphs. The graphml input-output file format is partially implemented. We also provide a Client/Server which allows, among other things, to easily interface Pigale with other programs (using a pipe). The library includes the following new algorithms based on recent theoretical researches of our site. General Algorithms: a planarity test and an embedding computation algorithm using Fraysseix-Rosenstiehl left-right algorithm (probably the fastest planarity test a linear time algorithm to locate a Kuratowski subdivision or a cotree critical partial subgraph in a non planar graph a linear time 3-connexity test for planar graphs a linear time recognition algorithm for subdivisions of 3-connected planar graphs a linear time 4-connexity test for maximal planar graphs a fast Depth-First Search algorithm (unpublished), fast bipolar and regular orientation algorithms for planar graphs a linear time optimal triangulation algorithm for 3-connected planar graphs increasing the degrees by at most 6 a partitioner algorithm based on Factorial Analysis

Add your review

User reviews