Sponsored Content
Top Forums Shell Programming and Scripting Automatic generate 3D pie Graph Post 302506390 by sheikh76 on Sunday 20th of March 2011 01:17:10 PM
Old 03-20-2011
Thanks Sir. But how to run? How about if I have data from CSV or txt.

Code:
Sample:
Media,20
Document,15
DB,4
Others,15
Available,8

Because I need this scripts will get from this data CSV or txt.

Last edited by sheikh76; 03-20-2011 at 02:24 PM.. Reason: Try do CODE
 

3 More Discussions You Might Find Interesting

1. Solaris

How to generate graph from flat file by using unix script

Hi, I need to generate graph from the text file in Unix server. The file contains the following data, Fri Feb 03 07:01:00 PST 2012|3325 Fri Feb 03 07:02:00 PST 2012|3349 Fri Feb 03 07:03:00 PST 2012|3290 Fri Feb 03 07:04:00 PST 2012|3496 Fri Feb 03 07:05:00 PST 2012|3362 Fri Feb 03 07:06:00... (2 Replies)
Discussion started by: gkn
2 Replies

2. UNIX for Advanced & Expert Users

How to generate graph in unix?

Hi Friends, I need to generate a graph in on the basis of data available in csv file in unix. Please let me know how to generate the graph. Thanks Mayank (4 Replies)
Discussion started by: mayank2211
4 Replies

3. UNIX for Dummies Questions & Answers

Display Pie Chart/Bar Graph in microsoft outlook email using UNIX commands/Shell scripts

I have a shell script which executes to write html codes into a text file. My next step is to email the text file so that receiving person (people who i send email to) should be able to see pie/chart or bar graph (whatever i design in my code) in their email. Following is the example of a sample... (7 Replies)
Discussion started by: bikerboy
7 Replies
Graph::TransitiveClosure(3pm)				User Contributed Perl Documentation			     Graph::TransitiveClosure(3pm)

Graph::TransitiveClosure - create and query transitive closure of graph

SYNOPSIS
use Graph::TransitiveClosure; use Graph::Directed; # or Undirected my $g = Graph::Directed->new; $g->add_...(); # build $g # Compute the transitive closure graph. my $tcg = Graph::TransitiveClosure->new($g); $tcg->is_reachable($u, $v) # Identical to $tcg->has_edge($u, $v) # Being reflexive is the default, meaning that null transitions # (transitions from a vertex to the same vertex) are included. my $tcg = Graph::TransitiveClosure->new($g, reflexive => 1); my $tcg = Graph::TransitiveClosure->new($g, reflexive => 0); # is_reachable(u, v) is always reflexive. $tcg->is_reachable($u, $v) # The reflexivity of is_transitive(u, v) depends of the reflexivity # of the transitive closure. $tcg->is_transitive($u, $v) # You can check any graph for transitivity. $g->is_transitive() my $tcg = Graph::TransitiveClosure->new($g, path_length => 1); $tcg->path_length($u, $v) # path_vertices is automatically always on so this is a no-op. my $tcg = Graph::TransitiveClosure->new($g, path_vertices => 1); $tcg->path_vertices($u, $v) # Both path_length and path_vertices. my $tcg = Graph::TransitiveClosure->new($g, path => 1); $tcg->path_vertices($u, $v) $tcg->length($u, $v) my $tcg = Graph::TransitiveClosure->new($g, attribute_name => 'length'); $tcg->path_length($u, $v) DESCRIPTION
You can use "Graph::TransitiveClosure" to compute the transitive closure graph of a graph and optionally also the minimum paths (lengths and vertices) between vertices, and after that query the transitiveness between vertices by using the "is_reachable()" and "is_transitive()" methods, and the paths by using the "path_length()" and "path_vertices()" methods. For further documentation, see the Graph::TransitiveClosure::Matrix. Class Methods new($g, %opt) Construct a new transitive closure object. Note that strictly speaking the returned object is not a graph; it is a graph plus other stuff. But you should be able to use it as a graph plus a couple of methods inherited from the Graph::TransitiveClosure::Matrix class. Object Methods These are only the methods 'native' to the class: see Graph::TransitiveClosure::Matrix for more. is_transitive($g) Return true if the Graph $g is transitive. transitive_closure_matrix Return the transitive closure matrix of the transitive closure object. INTERNALS The transitive closure matrix is stored as an attribute of the graph called "_tcm", and any methods not found in the graph class are searched in the transitive closure matrix class. perl v5.10.0 2009-01-17 Graph::TransitiveClosure(3pm)
All times are GMT -4. The time now is 02:07 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy