Creating large graphs with Tulip


 
Thread Tools Search this Thread
Special Forums News, Links, Events and Announcements UNIX and Linux RSS News Creating large graphs with Tulip
# 1  
Old 05-20-2008
Creating large graphs with Tulip

Tue, 20 May 2008 15:00:00 GMT
Tulip a framework that allows you to create, visualize, manipulate, and export large graphs. Tulip can import graphs from the popular Graphviz package and allows you to export a graph visualization in a number of bitmap image formats as well as SVG and EPS for eventual inclusion into a PDF file.


Source...
Login or Register to Ask a Question

Previous Thread | Next Thread

3 More Discussions You Might Find Interesting

1. Programming

Creating area graphs in jqplot

How can area graphs be created in jqplot? Example can be seen here: dygraphs JavaScript Visualization Library In the example the line graphs and the grid are superimposed on the area graphs. I dont think it is supported out of the box for jqplot. I would normally do this with a double fill: -... (0 Replies)
Discussion started by: figaro
0 Replies

2. Shell Programming and Scripting

Creating graphs

Platform: solaris 9 x86 I want to be able to create excel like line graphs with basic input data and use it on a webpage or worst case so I can use it to insert to a document type of input file I would have, example below datainput.txt: date,requests,failures,success 20100501,80,10,70... (5 Replies)
Discussion started by: frustrated1
5 Replies

3. Shell Programming and Scripting

Creating large number of files of specific size

Hi I am new to shell scripting.I want to create a batch file which creates a desired number of files with a specific size say 1MB each to consume space.How can i go about it using for loop /any other loop condition using shell script? Thanks (3 Replies)
Discussion started by: swatideswal
3 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)