graph and chart
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 774
Graph::Flowchart 0.10
Graph::Flowchart is a Perl module that can generate easily flowcharts as Graph::Easy objects. more>>
Graph::Flowchart is a Perl module that can generate easily flowcharts as Graph::Easy objects.
SYNOPSIS
use Graph::Flowchart;
my $flow = Graph::Flowchart->new();
print $flow->as_ascii();
This module lets you easily create flowcharts as Graph::Easy objects. This means you can output your flowchart as HTML, ASCII, Boxart (unicode drawing) or SVG.
Classes
The nodes constructed by the various add_* methods will set the subclass of the node according to the following list:
start
The start block.
end
The end block, created by finish().
block
Orindary code blocks, f.i. from $b = 9;.
if, for, while, until
Blocks for the various constructs for conditional and loop constructs.
sub
For sub routine declarations.
use
For use, no and require statements.
goto, break, return, next, last, continue
Blocks for the various constructs for jumps/returns.
true, false, goto, call, return, break, next, continue
Classes for edges of the true and false if-branches, and for goto, as well as sub routine calls.
Each class will get some default attributes, like if constructs having a diamond-shape.
You can override the graph appearance most easily by changing the (sub)-class attributes:
my $chart = Graph::Flowchart->new();
$chart->add_block($a = 9;);
$chart->add_if_then($a == 9;, $b = 1;);
$chart->finish();
my $graph = $chart->as_graph();
Now $graph is a Graph::Easy object and you can manipulate the class attributes like so:
$graph->set_attribute(node.if, fill, red);
$graph->set_attribute(edge.true, color, green);
print $graph->as_html_file();
This will color all conditional blocks red, and edges that represent the true branch green.
<<lessSYNOPSIS
use Graph::Flowchart;
my $flow = Graph::Flowchart->new();
print $flow->as_ascii();
This module lets you easily create flowcharts as Graph::Easy objects. This means you can output your flowchart as HTML, ASCII, Boxart (unicode drawing) or SVG.
Classes
The nodes constructed by the various add_* methods will set the subclass of the node according to the following list:
start
The start block.
end
The end block, created by finish().
block
Orindary code blocks, f.i. from $b = 9;.
if, for, while, until
Blocks for the various constructs for conditional and loop constructs.
sub
For sub routine declarations.
use
For use, no and require statements.
goto, break, return, next, last, continue
Blocks for the various constructs for jumps/returns.
true, false, goto, call, return, break, next, continue
Classes for edges of the true and false if-branches, and for goto, as well as sub routine calls.
Each class will get some default attributes, like if constructs having a diamond-shape.
You can override the graph appearance most easily by changing the (sub)-class attributes:
my $chart = Graph::Flowchart->new();
$chart->add_block($a = 9;);
$chart->add_if_then($a == 9;, $b = 1;);
$chart->finish();
my $graph = $chart->as_graph();
Now $graph is a Graph::Easy object and you can manipulate the class attributes like so:
$graph->set_attribute(node.if, fill, red);
$graph->set_attribute(edge.true, color, green);
print $graph->as_html_file();
This will color all conditional blocks red, and edges that represent the true branch green.
Download (0.034MB)
Added: 2007-07-06 License: Perl Artistic License Price:
845 downloads
Graph 0.81
Graph is a Perl module with graph data structures and algorithms. more>>
Graph is a Perl module with graph data structures and algorithms.
SYNOPSIS
use Graph;
my $g0 = Graph->new; # A directed graph.
use Graph::Directed;
my $g1 = Graph::Directed->new; # A directed graph.
use Graph::Undirected;
my $g2 = Graph::Undirected->new; # An undirected graph.
$g->add_edge(...);
$g->has_edge(...)
$g->delete_edge(...);
$g->add_vertex(...);
$g->has_vertex(...);
$g->delete_vertex(...);
$g->vertices(...)
$g->edges(...)
<<lessSYNOPSIS
use Graph;
my $g0 = Graph->new; # A directed graph.
use Graph::Directed;
my $g1 = Graph::Directed->new; # A directed graph.
use Graph::Undirected;
my $g2 = Graph::Undirected->new; # An undirected graph.
$g->add_edge(...);
$g->has_edge(...)
$g->delete_edge(...);
$g->add_vertex(...);
$g->has_vertex(...);
$g->delete_vertex(...);
$g->vertices(...)
$g->edges(...)
Download (0.12MB)
Added: 2007-07-02 License: Perl Artistic License Price:
1427 downloads
Apache::Wyrd::Chart 0.93
Apache::Wyrd::Chart is an embed Dynamically-redrawn PNG charts in HTML. more>>
Apache::Wyrd::Chart is a Perl module for embed Dynamically-redrawn PNG charts in HTML.
SYNOPSIS
< BASENAME::Chart img="chart.png" type="bars" height="200" width="300" >
< BASENAME::Query >
select month, price
from monthly_prices
order by month
< /BASENAME::Query >
< /BASENAME::Chart >
Chart-graphic Wyrd wrapping the GD::Graph Module. Creates a graphic file (PNG) and a meta-data file based on data handed it to by an Apache::Wyrd::Query Wyrd.
<<lessSYNOPSIS
< BASENAME::Chart img="chart.png" type="bars" height="200" width="300" >
< BASENAME::Query >
select month, price
from monthly_prices
order by month
< /BASENAME::Query >
< /BASENAME::Chart >
Chart-graphic Wyrd wrapping the GD::Graph Module. Creates a graphic file (PNG) and a meta-data file based on data handed it to by an Apache::Wyrd::Query Wyrd.
Download (0.12MB)
Added: 2006-07-31 License: Perl Artistic License Price:
1181 downloads
Q-Graph 1.4
Q-Graph is a collection of Q scripts that provide a graph data structure and a full-featured graph editor. more>>
Q-Graph is a collection of Q scripts that provide a graph data structure and a full-featured graph editor (the latter requires Tcl/Tk).
Q-Graph library can be used to implement and test graph algorithms using the Q language.
Q is a functional programming language based on term rewriting. Thus, a Q program or "script" is simply a collection of equations which are used to evaluate expressions in a symbolic fashion.
The equations establish algebraic identities and are interpreted as rewriting rules in order to reduce expressions to "normal forms".
For instance, here is how you define a function sqr which squares its argument by multiplying it with itself:
sqr X = X*X;
Note that, as in Prolog, capitalized identifiers are used to indicate the variables in an equation, which are bound to the actual values when an equation is applied. Equations may also include a condition part, as in the following definition of the factorial function:
fact N = N*fact (N-1) if N>0;
= 1 otherwise;
Functions on structured arguments are defined by "pattern matching". E.g., the product of a list (denoted in Prolog-like syntax) can be computed with these two equations:
prod [] = 1;
prod [X|Xs] = X*prod Xs;
With this definition, the factorial can now also be defined as follows (the notation [1..N], as in Haskell, denotes an arithmetic sequence):
fact N = prod [1..N];
As you can see, the definitions are really just like mathematical equations. The syntax is superficially similar to other modern functional languages like Miranda and Haskell, except that Q is "free-format", i.e., it does not use layout to indicate syntactical structure (thus the semicolon is used to terminate an equation).
Due to its term rewriting heritage, Q goes well beyond most other functional languages in that it also allows you to perform computations with symbolic expressions. For instance, with the definition of the sqr function from above, you will find that sqr (X+1) evaluates to (X+1)*(X+1). This might first look like an arcane feature, but it is actually quite useful, because you can try your definitions with symbolic inputs, too.
<<lessQ-Graph library can be used to implement and test graph algorithms using the Q language.
Q is a functional programming language based on term rewriting. Thus, a Q program or "script" is simply a collection of equations which are used to evaluate expressions in a symbolic fashion.
The equations establish algebraic identities and are interpreted as rewriting rules in order to reduce expressions to "normal forms".
For instance, here is how you define a function sqr which squares its argument by multiplying it with itself:
sqr X = X*X;
Note that, as in Prolog, capitalized identifiers are used to indicate the variables in an equation, which are bound to the actual values when an equation is applied. Equations may also include a condition part, as in the following definition of the factorial function:
fact N = N*fact (N-1) if N>0;
= 1 otherwise;
Functions on structured arguments are defined by "pattern matching". E.g., the product of a list (denoted in Prolog-like syntax) can be computed with these two equations:
prod [] = 1;
prod [X|Xs] = X*prod Xs;
With this definition, the factorial can now also be defined as follows (the notation [1..N], as in Haskell, denotes an arithmetic sequence):
fact N = prod [1..N];
As you can see, the definitions are really just like mathematical equations. The syntax is superficially similar to other modern functional languages like Miranda and Haskell, except that Q is "free-format", i.e., it does not use layout to indicate syntactical structure (thus the semicolon is used to terminate an equation).
Due to its term rewriting heritage, Q goes well beyond most other functional languages in that it also allows you to perform computations with symbolic expressions. For instance, with the definition of the sqr function from above, you will find that sqr (X+1) evaluates to (X+1)*(X+1). This might first look like an arcane feature, but it is actually quite useful, because you can try your definitions with symbolic inputs, too.
Download (0.085MB)
Added: 2006-02-09 License: GPL (GNU General Public License) Price:
1352 downloads
Open Flash Chart 1.9.2
Open Flash Chart software creates Flash-based charts for Web pages. more>>
Open Flash Chart software creates Flash-based charts for Web pages.
How does it work?
1. User browses to your web site.
2. The browser downloads the web page which contains the Open Flash Chart.
3. Open Flash Chart downloads the data file and displays the chart.
When you add Open Flash Chart to your web page, you tell it where to find the data file.
Why is that great?
When the user downloads the web page, Open Flash Chart requests the chart data from the server. The server knows who the user is so it can generate a chart for that particular user showing up to the minute data.
Is it complicated to set up?
You will need to include the Open Flash Chart in your HTML, and you also need to provide the data file on the server. The data file is either a text file, or a .php (or another flavour of dynamic) page.
For a simple chart you would just drop the data.txt file on your website and point the Open Flash Chart to this URL.
But what we really want is dynamic data that is pulled from a database or calculated or something. To do this you need to create the data file when it is requested. To do this we point the Open Flash Chart to a .php page and this PHP page does your calculations and/or database lookups, then outputs the data file.
To make this a bit easier I have written a PHP class to write the data file for you.
Enhancements:
- The PHP was updated to enable 3D charts and glass charts.
- Some more options were added to the other graph types.
<<lessHow does it work?
1. User browses to your web site.
2. The browser downloads the web page which contains the Open Flash Chart.
3. Open Flash Chart downloads the data file and displays the chart.
When you add Open Flash Chart to your web page, you tell it where to find the data file.
Why is that great?
When the user downloads the web page, Open Flash Chart requests the chart data from the server. The server knows who the user is so it can generate a chart for that particular user showing up to the minute data.
Is it complicated to set up?
You will need to include the Open Flash Chart in your HTML, and you also need to provide the data file on the server. The data file is either a text file, or a .php (or another flavour of dynamic) page.
For a simple chart you would just drop the data.txt file on your website and point the Open Flash Chart to this URL.
But what we really want is dynamic data that is pulled from a database or calculated or something. To do this you need to create the data file when it is requested. To do this we point the Open Flash Chart to a .php page and this PHP page does your calculations and/or database lookups, then outputs the data file.
To make this a bit easier I have written a PHP class to write the data file for you.
Enhancements:
- The PHP was updated to enable 3D charts and glass charts.
- Some more options were added to the other graph types.
Download (0.072MB)
Added: 2007-08-11 License: GPL (GNU General Public License) Price:
814 downloads
SVGGraph 0.07
SVGGraph is a Perl extension for creating SVG Graphs / Diagrams / Charts / Plots. more>>
SVGGraph is a Perl extension for creating SVG Graphs / Diagrams / Charts / Plots.
SYNOPSIS
use SVGGraph;
my @a = (1, 2, 3, 4);
my @b = (3, 4, 3.5, 6.33);
print "Content-type: image/svg-xmlnn";
my $SVGGraph = new SVGGraph;
print SVGGraph->CreateGraph(
{title => Financial Results Q1 2002},
[@a, @b, Staplers, red]
);
This module converts sets of arrays with coordinates into graphs, much like GNUplot would. It creates the graphs in the SVG (Scalable Vector Graphics) format. It has two styles, verticalbars and spline. It is designed to be light-weight.
If your internet browser cannot display SVG, try downloading a plugin at adobe.com.
EXAMPLES
For examples see: http://pearlshed.nl/svggraph/1.png and http://pearlshed.nl/svggraph/2.png
Long code example:
#!/usr/bin/perl -w -I.
use strict;
use SVGGraph;
### Array with x-values
my @a = (1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20);
### Arrays with y-values
my @b = (-5, 2, 1, 5, 8, 8, 9, 5, 4, 10, 2, 1, 5, 8, 8, 9, 5, 4, 10, 5);
my @c = (6, -4, 2, 1, 5, 8, 8, 9, 5, 4, 10, 2, 1, 5, 8, 8, 9, 5, 4, 10);
my @d = (1, 2, 3, 4, 9, 8, 7, 6, 5, 12, 30, 23, 12, 17, 13, 23, 12, 10, 20, 11);
my @e = (3, 1, 2, -3, -4, -9, -8, -7, 6, 5, 12, 30, 23, 12, 17, 13, 23, 12, 10, 20);
### Initialise
my $SVGGraph = new SVGGraph;
### Print the elusive content-type so the browser knows what mime type to expect
print "Content-type: image/svg-xmlnn";
### Print the graph
print $SVGGraph->CreateGraph( {
graphtype => verticalbars, ### verticalbars or spline
imageheight => 300, ### The total height of the whole svg image
barwidth => 8, ### Width of the bar or dot in pixels
horiunitdistance => 20, ### This is the distance in pixels between 1 x-unit
title => Financial Results Q1 2002,
titlestyle => font-size:24;fill:#FF0000;,
xlabel => Week,
xlabelstyle => font-size:16;fill:darkblue,
ylabel => Revenue (x1000 USD),
ylabelstyle => font-size:16;fill:brown,
legendoffset => 10, 10 ### In pixels from top left corner
},
[@a, @b, Bananas, #FF0000],
[@a, @c, Apples, #006699],
[@a, @d, Strawberries, #FF9933],
[@a, @e, Melons, green]
);
<<lessSYNOPSIS
use SVGGraph;
my @a = (1, 2, 3, 4);
my @b = (3, 4, 3.5, 6.33);
print "Content-type: image/svg-xmlnn";
my $SVGGraph = new SVGGraph;
print SVGGraph->CreateGraph(
{title => Financial Results Q1 2002},
[@a, @b, Staplers, red]
);
This module converts sets of arrays with coordinates into graphs, much like GNUplot would. It creates the graphs in the SVG (Scalable Vector Graphics) format. It has two styles, verticalbars and spline. It is designed to be light-weight.
If your internet browser cannot display SVG, try downloading a plugin at adobe.com.
EXAMPLES
For examples see: http://pearlshed.nl/svggraph/1.png and http://pearlshed.nl/svggraph/2.png
Long code example:
#!/usr/bin/perl -w -I.
use strict;
use SVGGraph;
### Array with x-values
my @a = (1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20);
### Arrays with y-values
my @b = (-5, 2, 1, 5, 8, 8, 9, 5, 4, 10, 2, 1, 5, 8, 8, 9, 5, 4, 10, 5);
my @c = (6, -4, 2, 1, 5, 8, 8, 9, 5, 4, 10, 2, 1, 5, 8, 8, 9, 5, 4, 10);
my @d = (1, 2, 3, 4, 9, 8, 7, 6, 5, 12, 30, 23, 12, 17, 13, 23, 12, 10, 20, 11);
my @e = (3, 1, 2, -3, -4, -9, -8, -7, 6, 5, 12, 30, 23, 12, 17, 13, 23, 12, 10, 20);
### Initialise
my $SVGGraph = new SVGGraph;
### Print the elusive content-type so the browser knows what mime type to expect
print "Content-type: image/svg-xmlnn";
### Print the graph
print $SVGGraph->CreateGraph( {
graphtype => verticalbars, ### verticalbars or spline
imageheight => 300, ### The total height of the whole svg image
barwidth => 8, ### Width of the bar or dot in pixels
horiunitdistance => 20, ### This is the distance in pixels between 1 x-unit
title => Financial Results Q1 2002,
titlestyle => font-size:24;fill:#FF0000;,
xlabel => Week,
xlabelstyle => font-size:16;fill:darkblue,
ylabel => Revenue (x1000 USD),
ylabelstyle => font-size:16;fill:brown,
legendoffset => 10, 10 ### In pixels from top left corner
},
[@a, @b, Bananas, #FF0000],
[@a, @c, Apples, #006699],
[@a, @d, Strawberries, #FF9933],
[@a, @e, Melons, green]
);
Download (0.007MB)
Added: 2007-07-26 License: Perl Artistic License Price:
821 downloads
B::Graph 0.51
B::Graph is a Perl compiler backend to produce graphs of OP trees. more>>
B::Graph is a Perl compiler backend to produce graphs of OP trees.
SYNOPSIS
perl -MO=Graph,-text prog.pl >graph.txt
perl -MO=Graph,-vcg prog.pl >graph.vcg
xvcg graph.vcg
perl -MO=Graph,-dot prog.pl | dot -Tps >graph.ps
This module is a backend to the perl compiler (B::*) which, instead of outputting bytecode or C based on perls compiled version of a program, writes descriptions in graph-description languages specifying graphs that show the programs structure. It currently generates descriptions for the VCG tool (http://www.cs.uni-sb.de/RW/users/sander/html/gsvcg1.html) and Dot (part of the graph visualization toolkit from AT&T: http://www.research.att.com/sw/tools/graphviz/). It also can produce plain text output (which is more useful for debugging the module itself than anything else, though you might be able to make cut the nodes out and make a mobile or something similar).
OPTIONS
Like any other compiler backend, this module needs to be invoked using the O module to run correctly:
perl -MO=Graph,-opt,-opt,-opt program.pl
OR
perl -MO=Graph,-opt,obj -e BEGIN {$obj = ["hi"]}; print $obj
OR EVEN
perl -e use O qw(Graph -opt obj obj); print "hi!n";
Obj is the name of a perl variable whose contents will be examined. It cant be a my() variable, and it shouldnt have a prefix symbol ($@^*), though you can specify a package -- the name will be used to look up a GV, whose various fields will lead to the scalar, array, and other values that correspond to the named variable. If no object is specified, the whole main program, including the CV that points to its pad, will be displayed.
Each of the the opts can come from one of the following (each set is mutually exclusive; case and underscores are insignificant):
-text, -vcg, -dot
Produce output of the appropriate type. The default is -text, which isnt useful for much of anything (it does draw some nice ASCII boxes, though).
-addrs, -no_addrs
Each of the nodes on the graph produced corresponds to a C structure that has an address and includes pointers to other structures. The module uses these addresses to decide how to draw edges, but it makes the graph more compact if they arent printed. The default is -no_addrs.
-compile_order, -run_order
The collection of OPs that perl compiles a script into has two different layers of structure. It has a tree structure which corresponds roughly to the synactic nesting of constructs in the source text, and a roughly linked-list representation, essentially a postorder traversal of this tree, which is used at runtime to decide what to do next. The graph can be drawn to emphasize one structure or the other. The former, compile_order, is the default, as it tends to lead to graphs with aspect ratios close to those of standard paper.
-SVs, -no_SVs
If OPs represent a programs compiled code, SVs represent its data. This includes literal numbers and strings (IVs, NVs, PVs, PVIVs, and PVNVs), regular arrays, hashes, and references (AVs, HVs, and RVs), but also the structures that correspond to individual variables (special HVs for symbol tables and GVs to represent values within them, and special AVs that hold my() variables (as well as compiler temporaries)), structures that keep track of code (CVs), and a variety of others. The default is to display all these too, to give a complete picture, but if you arent in a holistic mood, you can make them disappear.
-ellipses, -rhombs
The module tries to give the nodes representing SVs a different shape from those of OPs. OPs are usually rectangular, so two obvious shapes for SVs are ellipses and rhombuses (stretched diamonds). This option currently only makes a difference for VCG (ellipse is the default).
-stashes, -no_stashes
The hashes that perl uses to represent symbol tables are called stashes. Since every GV has a pointer back to its stash, its virtually inevitable for the links in a graph to lead to the main stash. Unfortunately stashes, especially the main one, can be quite big, and lead to forests of other structures -- theres one GV and another SV for each magic variable, plus all of @INC and %ENV, and so on. To prevent information overload, then, the display of stashes is disabled by default.
-fileGVs, -no_fileGVs
Another kind graph element that can be annoying are the pointers from every GV and COP (a kind of OP that occurs for every statement) to the GV that represents the file from which that code came (used for error messages). By default, these links arent shown, to keep them from cluttering the graph. Also, perls internal interfaces changed in a recent version, so in perl 5.005_63 or later you cant see the fileGVs at all.
-SEQs, -no_SEQs
As it is visited in the peephole optimization phase, each OP gets a sequence number, which is currently used by anything (except the peephole optimizer, to avoid visiting OPs twice). If you want to see these, ask for them. (COPs have their own sequence numbers too, but theyre more interesting to look at -- for instance, theyre used to bound the lifetimes of lexicals).
-types, -no_types
B::Graph always gives the type of each OP symbolically (entersub), but it can also print the numeric value of the type field, if you want. The default is no_types.
-float, -no_float
Almost every OP has an op_next and an op_sibling pointer, and B::Graph colors them distinctively (pink and light blue, respectively). Because of this, it isnt strictly necessary to anchor the arrow on a line in the OPs box saying op_next. The float option lets the graph layout engine start these arrows wherever it wants, which can sometimes lead to a more pleasing layout, at the expense of being less obvious. The default is not to float.
-targlinks, -no_targlinks
Lexical (my()) variables and temporary values used by individual OPs are stored in pads, per-code arrays linked to the CV. OPs store indexes into these arrays in the op_targ field, but B::Graph can often also draw links directly from the OP to the SV that stores the name of the variable. These links dont correspond to any real pointers, however, and they can make the graph more complicated, so they are disabled by default.
<<lessSYNOPSIS
perl -MO=Graph,-text prog.pl >graph.txt
perl -MO=Graph,-vcg prog.pl >graph.vcg
xvcg graph.vcg
perl -MO=Graph,-dot prog.pl | dot -Tps >graph.ps
This module is a backend to the perl compiler (B::*) which, instead of outputting bytecode or C based on perls compiled version of a program, writes descriptions in graph-description languages specifying graphs that show the programs structure. It currently generates descriptions for the VCG tool (http://www.cs.uni-sb.de/RW/users/sander/html/gsvcg1.html) and Dot (part of the graph visualization toolkit from AT&T: http://www.research.att.com/sw/tools/graphviz/). It also can produce plain text output (which is more useful for debugging the module itself than anything else, though you might be able to make cut the nodes out and make a mobile or something similar).
OPTIONS
Like any other compiler backend, this module needs to be invoked using the O module to run correctly:
perl -MO=Graph,-opt,-opt,-opt program.pl
OR
perl -MO=Graph,-opt,obj -e BEGIN {$obj = ["hi"]}; print $obj
OR EVEN
perl -e use O qw(Graph -opt obj obj); print "hi!n";
Obj is the name of a perl variable whose contents will be examined. It cant be a my() variable, and it shouldnt have a prefix symbol ($@^*), though you can specify a package -- the name will be used to look up a GV, whose various fields will lead to the scalar, array, and other values that correspond to the named variable. If no object is specified, the whole main program, including the CV that points to its pad, will be displayed.
Each of the the opts can come from one of the following (each set is mutually exclusive; case and underscores are insignificant):
-text, -vcg, -dot
Produce output of the appropriate type. The default is -text, which isnt useful for much of anything (it does draw some nice ASCII boxes, though).
-addrs, -no_addrs
Each of the nodes on the graph produced corresponds to a C structure that has an address and includes pointers to other structures. The module uses these addresses to decide how to draw edges, but it makes the graph more compact if they arent printed. The default is -no_addrs.
-compile_order, -run_order
The collection of OPs that perl compiles a script into has two different layers of structure. It has a tree structure which corresponds roughly to the synactic nesting of constructs in the source text, and a roughly linked-list representation, essentially a postorder traversal of this tree, which is used at runtime to decide what to do next. The graph can be drawn to emphasize one structure or the other. The former, compile_order, is the default, as it tends to lead to graphs with aspect ratios close to those of standard paper.
-SVs, -no_SVs
If OPs represent a programs compiled code, SVs represent its data. This includes literal numbers and strings (IVs, NVs, PVs, PVIVs, and PVNVs), regular arrays, hashes, and references (AVs, HVs, and RVs), but also the structures that correspond to individual variables (special HVs for symbol tables and GVs to represent values within them, and special AVs that hold my() variables (as well as compiler temporaries)), structures that keep track of code (CVs), and a variety of others. The default is to display all these too, to give a complete picture, but if you arent in a holistic mood, you can make them disappear.
-ellipses, -rhombs
The module tries to give the nodes representing SVs a different shape from those of OPs. OPs are usually rectangular, so two obvious shapes for SVs are ellipses and rhombuses (stretched diamonds). This option currently only makes a difference for VCG (ellipse is the default).
-stashes, -no_stashes
The hashes that perl uses to represent symbol tables are called stashes. Since every GV has a pointer back to its stash, its virtually inevitable for the links in a graph to lead to the main stash. Unfortunately stashes, especially the main one, can be quite big, and lead to forests of other structures -- theres one GV and another SV for each magic variable, plus all of @INC and %ENV, and so on. To prevent information overload, then, the display of stashes is disabled by default.
-fileGVs, -no_fileGVs
Another kind graph element that can be annoying are the pointers from every GV and COP (a kind of OP that occurs for every statement) to the GV that represents the file from which that code came (used for error messages). By default, these links arent shown, to keep them from cluttering the graph. Also, perls internal interfaces changed in a recent version, so in perl 5.005_63 or later you cant see the fileGVs at all.
-SEQs, -no_SEQs
As it is visited in the peephole optimization phase, each OP gets a sequence number, which is currently used by anything (except the peephole optimizer, to avoid visiting OPs twice). If you want to see these, ask for them. (COPs have their own sequence numbers too, but theyre more interesting to look at -- for instance, theyre used to bound the lifetimes of lexicals).
-types, -no_types
B::Graph always gives the type of each OP symbolically (entersub), but it can also print the numeric value of the type field, if you want. The default is no_types.
-float, -no_float
Almost every OP has an op_next and an op_sibling pointer, and B::Graph colors them distinctively (pink and light blue, respectively). Because of this, it isnt strictly necessary to anchor the arrow on a line in the OPs box saying op_next. The float option lets the graph layout engine start these arrows wherever it wants, which can sometimes lead to a more pleasing layout, at the expense of being less obvious. The default is not to float.
-targlinks, -no_targlinks
Lexical (my()) variables and temporary values used by individual OPs are stored in pads, per-code arrays linked to the CV. OPs store indexes into these arrays in the op_targ field, but B::Graph can often also draw links directly from the OP to the SV that stores the name of the variable. These links dont correspond to any real pointers, however, and they can make the graph more complicated, so they are disabled by default.
Download (0.012MB)
Added: 2007-06-26 License: Perl Artistic License Price:
851 downloads
Daylight Chart 1.6
Daylight Chart project shows sunrise and sunset times in an attractive chart, for any location in the world. more>>
Daylight Chart project shows sunrise and sunset times in an attractive chart, for any location in the world. The effect of daylight savings time is also displayed. Charts can be exported to image files.
<<less Download (2.6MB)
Added: 2007-08-04 License: GPL (GNU General Public License) Price:
498 downloads
KD Chart 2.0 Beta1
KDChart is a tool for creating business charts and is the most powerful Qt component of its kind. more>>
KDChart application is a tool for creating business charts and is the most powerful Qt component of its kind.
Besides from having all the standard features, it also enables the developer to design and manage a large number of axes and provides sophisticated means of customization.
In addition to detailed and precisely configuring the chart layout it is possible to complement the design by adding custom rich-text boxes and/or frames to data points or to random positions.
Being extremely configurable, KDChart is also easily scalable by automatically adjusting font sizes and layout when being resized. This makes it possible to quickly and efficiently create user-friendly programs that offer the same level of functionality, or a even higher one, in Qt programs as on other platforms. It is no coincidence that the current version of the KOffice productivity suite uses our library.
Whats New in 1.1.3 Stable Release:
Besides from various smaller fixes, code adjusting and other issues like documentation updates, the following list contains a list of bugfixes included in the KD Chart 1.1.3 release.
Printing:
- Fixed the display of the axis title font when using high resolution printing.
Bars:
Fixes 3D bars painting:
- The front face of the bar now matches the y axis labels.
- Fixed various rendering errors depending of the values of the bars (high values - negative values ...)
Fixes bars painting
- Fixed painting of excess arrows, when the user choose to display a restricted view of the chart ( start/end values).
- The user have a better control over the bar Width when needed.
- Fixed occasional painting problem when resizing a barPercent view.
- Bar painting is more accurate and looks better.
3D Lines:
- Fixed wrong display for 3D lines painting.
Axis
- Fixed axis subdelimiters: Were not always precisely matching with the grid lines, data values.
- Added the possibility to force the diplay of non fractional values on the axis.
Legends:
- Fixed alignment of the legend text to its marker.
- Fixed rendering legends when changing its position and orientation
Compiling:
- Fixed a compilation issue on gcc 3.4
Labels truncation and position:
- Several small issues has been fixed. Those cases were happening occasionally.
- .. and various other bug fixes and code tuning.
<<lessBesides from having all the standard features, it also enables the developer to design and manage a large number of axes and provides sophisticated means of customization.
In addition to detailed and precisely configuring the chart layout it is possible to complement the design by adding custom rich-text boxes and/or frames to data points or to random positions.
Being extremely configurable, KDChart is also easily scalable by automatically adjusting font sizes and layout when being resized. This makes it possible to quickly and efficiently create user-friendly programs that offer the same level of functionality, or a even higher one, in Qt programs as on other platforms. It is no coincidence that the current version of the KOffice productivity suite uses our library.
Whats New in 1.1.3 Stable Release:
Besides from various smaller fixes, code adjusting and other issues like documentation updates, the following list contains a list of bugfixes included in the KD Chart 1.1.3 release.
Printing:
- Fixed the display of the axis title font when using high resolution printing.
Bars:
Fixes 3D bars painting:
- The front face of the bar now matches the y axis labels.
- Fixed various rendering errors depending of the values of the bars (high values - negative values ...)
Fixes bars painting
- Fixed painting of excess arrows, when the user choose to display a restricted view of the chart ( start/end values).
- The user have a better control over the bar Width when needed.
- Fixed occasional painting problem when resizing a barPercent view.
- Bar painting is more accurate and looks better.
3D Lines:
- Fixed wrong display for 3D lines painting.
Axis
- Fixed axis subdelimiters: Were not always precisely matching with the grid lines, data values.
- Added the possibility to force the diplay of non fractional values on the axis.
Legends:
- Fixed alignment of the legend text to its marker.
- Fixed rendering legends when changing its position and orientation
Compiling:
- Fixed a compilation issue on gcc 3.4
Labels truncation and position:
- Several small issues has been fixed. Those cases were happening occasionally.
- .. and various other bug fixes and code tuning.
Download (5.8MB)
Added: 2006-04-19 License: Free To Use But Restricted Price:
736 downloads
graph-tool 0.9
graph-tool is a program to help with statistical analysis of graphs. more>>
graph-tool project is a program to help with statistical analysis of graphs.
Main features:
- support for directed and undirected graphs
- support for arbitrary vertex or edge properties
- generic filtering of edges and vertices
- several statistical measurements:
- degree (or scalar property) histogram
- vertex-vertex degree (or scalar property) correlation
- average nearest neighbours degree (or scalar property)
- vertex-edge-vertex correlation
- clustering coefficients
- assortativity coefficient
- average distance
- component statistics
- generation of random graphs with arbitrary degree distribution and degree correlation
- graph history measurement based on filtering
- support for graphml and dot file formats
The core algorithms are written in C++, making use of the Boost Graph Library, and template metaprogramming techniques, with performace in mind. The command line interface and other outlying code are written in python.
<<lessMain features:
- support for directed and undirected graphs
- support for arbitrary vertex or edge properties
- generic filtering of edges and vertices
- several statistical measurements:
- degree (or scalar property) histogram
- vertex-vertex degree (or scalar property) correlation
- average nearest neighbours degree (or scalar property)
- vertex-edge-vertex correlation
- clustering coefficients
- assortativity coefficient
- average distance
- component statistics
- generation of random graphs with arbitrary degree distribution and degree correlation
- graph history measurement based on filtering
- support for graphml and dot file formats
The core algorithms are written in C++, making use of the Boost Graph Library, and template metaprogramming techniques, with performace in mind. The command line interface and other outlying code are written in python.
Download (0.27MB)
Added: 2006-08-08 License: GPL (GNU General Public License) Price:
1178 downloads
LiveGraph 1.10
LiveGraph is a project consisting of a real-time graph plotter. more>>
LiveGraph is a project consisting of a real-time graph plotter.
While your application is computing and logging results to a CSV file using the LiveGraph Writer API, the plotter lets you visualise and monitor the results live - by instantly plotting charts and graphs of the data.
LiveGraph was developed in the academic domain and is being used for research on daily basis. Being open source, LiveGraph is absolutely free.
Whats inside?
LiveGraph consists of 3 major components.
First, there is a data file definition for transferable data log files. The file format is closely based on the comma separated values (CSV) text file format. LiveGraph defines a few small but important extensions, such as data column header definitions and file description annotations.
Second, there is a Java writer / logger API which provides application developers with a fast and easy way for writing data generated by an application into LiveGraph CSV files. The simplicity of the file format makes it straight forward for developers who use other programming languages than Java to create appropriate data files using their own routines. We are hoping that the open source community will contribute to the project by providing implementations of the writer API in other languages.
Finally, there is the LiveGraph plotter application. The plotter reads the LiveGraph data file (or any other CSV file) and plots the data series contained therein on the screen. The special feature that distinguishes LiveGraph from all the other data plotters is that LiveGraph can automatically re-examine the data file at short intervals and update the graphs of the screen. By using specialized caching techniques LiveGraph uses only very few computational resources for the updates, even if the data file grows very large and fast.
All this allows you to visualize the results of your application instantly and while it is still running. You dont have to worry about implementing any data visualization algorithms, instead you can concentrate on your actual task. As a useful by-product you are left with a complete data log, which you can delete later, if you do not need it.
You can find some additional information about LiveGraphs special features in the section "Why LiveGraph?". There, we explain in more detail, for which tasks there are better tools, and for which tasks LiveGraph might be the best tool currently around. In the user manual we describe the functions of LiveGraph application from the point of view of a desktop user. The developer manual provides all details you need to start using LiveGraph with your applications.
Enhancements:
The new major release version incorporates several new features:
- A real-time plotter that can automatically update graphs of your data while it is still being computed by your application.
- Concise and simple point-and-click interface that allows to quickly select and compare data series even in applications that output over 1000 series simultaneously.
- Transformation of data series for visual comparison by the virtue of a single click.
- The framework is Java-based and can run on any computer system. However, it is easily integrated with applications written in any programming language. Examples and tutorials are provided.
- LiveGraph reads files in a simple CSV-style format. For applications developed in Java, LiveGraph additionally provides an API that handles all data logging and persistency issues.elease version incorporates several new features.
<<lessWhile your application is computing and logging results to a CSV file using the LiveGraph Writer API, the plotter lets you visualise and monitor the results live - by instantly plotting charts and graphs of the data.
LiveGraph was developed in the academic domain and is being used for research on daily basis. Being open source, LiveGraph is absolutely free.
Whats inside?
LiveGraph consists of 3 major components.
First, there is a data file definition for transferable data log files. The file format is closely based on the comma separated values (CSV) text file format. LiveGraph defines a few small but important extensions, such as data column header definitions and file description annotations.
Second, there is a Java writer / logger API which provides application developers with a fast and easy way for writing data generated by an application into LiveGraph CSV files. The simplicity of the file format makes it straight forward for developers who use other programming languages than Java to create appropriate data files using their own routines. We are hoping that the open source community will contribute to the project by providing implementations of the writer API in other languages.
Finally, there is the LiveGraph plotter application. The plotter reads the LiveGraph data file (or any other CSV file) and plots the data series contained therein on the screen. The special feature that distinguishes LiveGraph from all the other data plotters is that LiveGraph can automatically re-examine the data file at short intervals and update the graphs of the screen. By using specialized caching techniques LiveGraph uses only very few computational resources for the updates, even if the data file grows very large and fast.
All this allows you to visualize the results of your application instantly and while it is still running. You dont have to worry about implementing any data visualization algorithms, instead you can concentrate on your actual task. As a useful by-product you are left with a complete data log, which you can delete later, if you do not need it.
You can find some additional information about LiveGraphs special features in the section "Why LiveGraph?". There, we explain in more detail, for which tasks there are better tools, and for which tasks LiveGraph might be the best tool currently around. In the user manual we describe the functions of LiveGraph application from the point of view of a desktop user. The developer manual provides all details you need to start using LiveGraph with your applications.
Enhancements:
The new major release version incorporates several new features:
- A real-time plotter that can automatically update graphs of your data while it is still being computed by your application.
- Concise and simple point-and-click interface that allows to quickly select and compare data series even in applications that output over 1000 series simultaneously.
- Transformation of data series for visual comparison by the virtue of a single click.
- The framework is Java-based and can run on any computer system. However, it is easily integrated with applications written in any programming language. Examples and tutorials are provided.
- LiveGraph reads files in a simple CSV-style format. For applications developed in Java, LiveGraph additionally provides an API that handles all data logging and persistency issues.elease version incorporates several new features.
Download (1.1MB)
Added: 2007-05-24 License: BSD License Price:
989 downloads
Graph-includes 0.11
Graph-includes creates a graph of dependencies between source files and/or groups of source files. more>>
Graph-includes creates a graph of dependencies between source files and/or groups of source files, with an emphasis on getting readable and usable graphs even for large projects.
Graph-includes project is meant to be an helper tool for a refactoring effort. Usability of the dependency graphs are currently improved by customizable grouping of several source files into a single node, and transitive reduction of the graph.
Enhancements:
- Ported to non-Unix platforms (tested on Windows).
- This release has finally implemented/fixed node group coloring.
- A default path for system-includes lookup has been added.
<<lessGraph-includes project is meant to be an helper tool for a refactoring effort. Usability of the dependency graphs are currently improved by customizable grouping of several source files into a single node, and transitive reduction of the graph.
Enhancements:
- Ported to non-Unix platforms (tested on Windows).
- This release has finally implemented/fixed node group coloring.
- A default path for system-includes lookup has been added.
Download (0.020MB)
Added: 2005-12-07 License: GPL (GNU General Public License) Price:
1416 downloads
SVG Charter Alpha 3
SVG charter is a project to build a tool to generate charts and graphs. more>>
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.
<<lessThe 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.
Download (0.007MB)
Added: 2007-07-17 License: LGPL (GNU Lesser General Public License) Price:
829 downloads
JGraph 5.9.2.0
JGraph is the leading Open Source Java Graph Visualization Library. It follows Swing design patterns to provide an API familiar to Swing programmers and functionality that provides a range of features. Graph visualization is a central requirement for applications such as workflow editors, computer and telecommunication networks display, flowcharts, VLSI and CAD, business process modeling, organizational charts, entity-relationship diagrams... more>>
JGraph - JGraph is the leading Open Source Java Graph Visualization Library. It follows Swing design patterns to provide an API familiar to Swing programmers and functionality that provides a range of features. Graph visualization is a central requirement for applications such as workflow editors, computer and telecommunication networks display, flowcharts, VLSI and CAD, business process modeling, organizational charts, entity-relationship and cause and effect diagrams, and much more.
The core JGraph library provides all the features required in a graph visualization library. Built on top of the core are JGraph Layout Pro and JGraphpad Pro. JGraph Layout Pro provides graph layouts that automatically position your nodes. There is a hierarchical layout for workflows, tree layouts for organization charts and so on. JGraphpad Pro is a complete application framework that enables you to rapidly prototype your application, dramatically reducing your time to market for your product.
Enhancements:
Version 5.9.2.0
General bug fixing
System Requirements:<<less
Download (136.7Kb)
Added: 2006-09-01 License: Free Price: Free
13 downloads
Genealogy Graph Generator 1.0
Genealogy Graph Generator (GGG) is a set of programs for automatically generating academic genealogy graphs. more>>
Genealogy Graph Generator (GGG) is a set of programs for automatically generating academic genealogy graphs. It tells you who your advisor and your advisors advisor and her advisor and so on are.
<<less Download (0.046MB)
Added: 2005-11-03 License: GPL (GNU General Public License) Price:
1454 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above graph and chart search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
