Free advanced graph chart collection software for linux

PHP Advanced Graphing Class is a PHP class that can be used to generate line, bar, and 2D/3D pie graphs from multiple data sets. PHP Advanced Graphing Class offers many style and data formatting options.
The graphs can be built from data defined with PHP code or with data imported from XML or CSV files. It can use custom colors, custom data point shapes or images, custom end arrows, an optional inline format, a custom graph scale, etc.
The graphs can be generated in PNG format either to a file or served as the current script output.
Enhancements:
- Bar charts and 2D/3D pie charts were added.

comisat Games Collection is an all-in-one free collection of games written in gambas for unix-like system. They are available in italian and (not completely) in english.

comisat Games Collection is FREE SOFTWARE, released under the terms of the GNU General Public License Version 2 as published by Free Software Fundation. You can help the development of comisat Games Collection testing the software, mailing bugs, translating the project in different languages, correcting and improving the code.

GENE Graph Export Engine is an advanced XML exporter.
GENE Graph Export Engine is a complex convertor/framework for multi-namespace XML transforming and exporting.
It is able to convert various XML types including SVG, DocBook, MathML, XSL-FO, and their combinations into a wide area of output formats: PDF, PNG, SVG, PS, MIF, RTF, and XHTML.
Custom XSLT scripts can be registered easily and are used automatically. It requires Sun JRE 5.0.
Enhancements:
- GENE Core bugfixes. FOP plugin bugfixes.
- Gene Runner I18N support has been added. l12n in Slovak.
- Configuration ability has been added.
- New command line switches have been added.
- Preliminary buggy CML (Chemical Markup Language) and XHTML->DocBook exporters have been added.

PerlBean::Collection is a Perl module that contains a collection of PerlBean objects.

SYNOPSIS

use strict;
use PerlBean;
use PerlBean::Collection;
use PerlBean::Attribute::Factory;

my $bean = PerlBean->new( {
package => Athlete,
} );
my $factory = PerlBean::Attribute::Factory->new();
my $attr = $factory->create_attribute( {
method_factory_name => name,
short_description => the name of the athlete,
} );
$bean->add_method_factory($attr);

my $bean2 = PerlBean->new( {
package => Cyclist,
base => [ qw(Athlete)],
} );
my $factory = PerlBean::Attribute::Factory->new();
my $attr2 = $factory->create_attribute( {
method_factory_name => cycle,
short_description => the cyclists cycle,
} );
$bean2->add_method_factory($attr2);

my $collection = PerlBean::Collection->new();
$collection->add_perl_bean($bean);
$collection->add_perl_bean($bean2);
$collection->write(tmp);

ABSTRACT

Code hierarchy generation for bean like Perl modules

PerlBean::Collection contains a collection of PerlBean objects in order to generate an hierarchy of Perl modules.

GNOME Advanced Preferences is an UI to tweak advanced GNOME preferences.

GNOME Advanced Preferences allows you to tweak hidden GNOME preferences, including custom keyboard shortcuts to execute specific commands, etc.

Stuff generally only available through GConf.

Graph::ModularDecomposition is a Perl module for modular decomposition of directed graphs.

SYNOPSIS

use Graph::ModularDecomposition qw(pairstring_to_graph tree_to_string);
my $g = new Graph::ModularDecomposition;

my $h = $g->pairstring_to_graph( ab,ac,bc );
print "yesn" if check_transitive( $h );
print "yesn" if $h->check_transitive; # same thing
my $m = $h->modular_decomposition_EGMS;
print tree_to_string( $m );

This module extends Graph::Directed by providing new methods related to modular decomposition.

The most important new method is modular_decomposition_EGMS(), which for a directed graph with n vertices finds the modular decomposition tree of the graph in O(n^2) time. Method tree_to_string() may be useful to represent the decomposition tree in a friendlier format; this needs to be explicitly imported.

If you need to decompose an undirected graph, represent it as a directed graph by adding two directed edges for each undirected edge.

The method classify() uses the modular decomposition tree to classify a directed graph as non-transitive, or for transitive digraphs, as series-parallel (linear or parallel modules only), decomposable (not series-parallel, but with at least one non-primitive module), indecomposable (primitive), decomposable but consisting of primitive or series modules only (only applies to graphs of at least 7 vertices), or unclassified (should never apply).

GOBLIN is a C++ class library focussed on graph optimization and network programming problems. GOBLIN Graph Library deals with all of the standard graph optimization problems discussed by textbooks and in courses on combinatorial optimization.
This software package also consists of a shell interpreter which extends the well-known Tcl/Tk language to graph objects and a graph browser and editor tool. Executable solvers are available for practical optimization problems. The graph browser applies for teaching and scientific documentation purposes.
GOBLIN is open source software and licenced by the GNU Lesser Public License (LGPL). That is, GOBLIN may be downloaded, compiled and used for scientific, educational and other purposes free of charge. For details, in particular the statements about redistribution and changes of the source code, observe the LGPL document which is attached to the package.
Main features:
- The gosh interpreter extends the Tcl/Tk scripting language to graph objects in a natural way.
- The goblet graph browser and editor tool. Graphical front end to the library.
- An open class hierarchy which strictly separates between abstract classes (all mathematical algorithms are defined as methods of abstract classes), implementations (i.e. by incidence lists, adjacency matrices) and logical views (problem transformations).
- A generic branch and bound module with several applications to graph optimization.
- Logging and tracing functionality which allows to study the various algorithms by examples.
- A runtime configuration module controls the selection of mathemetical methods, logging information, and the tracing of data objects.
- Compile time configuration module for code optimization.
- A file interface which can be easily extended to new problem classes.
- Source code for executable solver programs.
Today, GOBLIN provides strongly polynomial algorithms for the following graph optimization problems:
- Shortest paths in graphs and digraphs with negative lengths.
- Negative cycles and minimum mean cycles.
- Strong and 2-connected components.
- Minimum spanning trees, arborescences and 1-trees.
- Maximum st-flows, feasible circulations and b-flows.
- Min-cost st-flows, b-flows and circulations.
- Assignment problems of any kind.
- 1-matchings, b-matchings, capacitated b-matchings, f-factors and degree-constrained subgraphs.
- Directed and undirected Chinese postman problems, T-joins.
Enhancements:
- This release comes with explicit code for orthogonal drawing of trees.
- There are also new generator methods for regular planara graphs.
- A lot of doxygen comments has been added, but dexcription are still far from complete.

SVG charter is a project to build a tool to generate charts and graphs with SVG output to allow fully scalable data visualization.
The application came about after my personal frustration with not being able to read tiny GIF charts accurately.
Couldnt be simpler, though. You must run SVG Charter in the directory where the charting modules live. To change which charting module the engine uses, change the "require" call on line 62 of the charter.pl engine code. Then just run the code as follows:
./charter.pl [datafile in CSV format] > thechart.svg
The data file must be in a CSV format with the first row as headings and the subsequent rows as numeric data. Have a look at the data.csv file that comes packaged for an example.
SVG CHARTER LIMITATIONS
Right now the SVG Charter emits a fixed-aspect ratio graph.
SVG Charter can only emit a graph which is limited to 4 data series. There is no technical limitation on the number of data points, but 100 seems to be a practical limitation of whats easily readable.
SVG Charter currently emits fixed color schemes.
SVG Charter cannot configure the Legend location
SVG CHARTER CONTRIBUTIONS
Code contributions to SVG charter will be greatly appriciated. Feel free to tackle any limitation Ive listed above or any limiation you discover.
Enhancements:
- This release supports a very constrained scatter graph.