aiSee helps create graphs with complex layouts


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements UNIX and Linux RSS News aiSee helps create graphs with complex layouts
# 1  
Old 06-02-2008
aiSee helps create graphs with complex layouts

Mon, 02 Jun 2008 15:00:00 GMT
If you need robust graphing software, consider aiSee, a cross-platform graph package that supports nested graphs, exports to many bitmap and vector formats, and handles graphs with as many as a million nodes. aiSee is free for noncommercial use under its own license.


Source...
Login or Register to Ask a Question

Previous Thread | Next Thread

4 More Discussions You Might Find Interesting

1. Solaris

How to change raid layouts in veritas volume manager?

We have three disks under Raid 5. What should i do to make them Raid 0(striping)..... I mean how to change RAID layouts in VXVM ??? Please tell me with commands ..... Thanks in Advance. (0 Replies)
Discussion started by: vamshigvk475
0 Replies

2. Shell Programming and Scripting

Compare specific columns between two files having different layouts

Hi, My requirement is that I need to compare two files. For example : The first file will be having 15 columns and the second file will be having just 10 columns. Example : File1 : abcd,abrd,fun,D000,$15,$236,$217,$200,$200,$200... (3 Replies)
Discussion started by: gpsridhar
3 Replies

3. Shell Programming and Scripting

using Perl with rrdtool to create and update graphs

Hi guys, im having real difficulty getting my head around perl and rrdtool and was hoping someone could help I want to run a perl script from cron which retrieves the data every 5 mins, creates .rrd's if not already created, and updates the DS from the reultsHash or $key, then creates the... (2 Replies)
Discussion started by: jeffersno1
2 Replies

4. UNIX for Dummies Questions & Answers

System Layouts For SCO Systems.

I work as the Systems Administrator for a reasonably large Company. We have just started setting up a WAN. Before this WAN setup started it was a tedious job to admin all our servers all over the country. Before I was officialy the "Systems Administrator" our previous guy setup our new SCO Box to... (2 Replies)
Discussion started by: shimmer
2 Replies
Login or Register to Ask a Question
GVPACK(1)						      General Commands Manual							 GVPACK(1)

NAME
gvpack - merge and pack disjoint graphs SYNOPSIS
gvpack [ -nguv? ] [ -mmargin ] [ -ooutfile ] [ -Gname=value ] [ files ] DESCRIPTION
gvpack reads in a stream of graphs, combines the graphs into a single layout, and produces a single graph serving as the union of the input graphs. The input graphs must be in dot format, and must have all necessary layout information. Acceptable input is produced by applying a Graphviz layout program, such as dot or neato, with no -T flag. By default, the packing is done at the cluster level. Thus, parts of one graph will not intrude into any top-level clusters or overlap any nodes or edges of another. The output of gvpack can be used to produce concrete output by applying neato -s -n2 with the desired -T flag. OPTIONS
The following options are supported: -g Combines the graphs at the graph level. This uses more space, but prevents parts of one graph from occurring between parts of another. -Gname=value Specifies attributes to be added to the resulting union graph. For example, this can be used to specify a graph label. -mmargin Packs the graphs allowing a margin of output points around the parts. -n Combines the graphs at the node level. Clusters are ignored in the packing. -ooutput Prints output to the file output. If not given, gvpack uses stdout. -u Don't pack the graphs. Just combine them into a single graph. -v Verbose mode. -? Prints usage information and exit. OPERANDS
The following operand is supported: files Names of files containing 1 or more graphs in dot format. If no files operand is specified, the standard input will be used. RETURN CODES
gvpack returns 0 if there were no problems, and non-zero otherwise. EXAMPLES
ccomps -x abc.dot | dot | gvpack | neato -s -n2 -Tps This pipeline decomposes the graph in abc.dot into its connected components, lays out each using dot, packs them all together again, and produces the final drawing in PostScript. Of course, there is nothing to prevent one from using different layouts for each component. BUGS
All the input graphs must be directed or undirected. An input graph should not have a label, since this will be used in its layout. Since gvpack ignores root graph labels, resulting layout may contain some extra space. gvpack unsets the bounding box attribute of all non-cluster subgraphs. AUTHORS
Emden R. Gansner <erg@research.att.com> SEE ALSO
gvpr(1), dot(1), neato(1), twopi(1), ccomps(1), libpack(3) 8 April 2003 GVPACK(1)