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
TRED(1) 						      General Commands Manual							   TRED(1)

NAME
tred - transitive reduction filter for directed graphs SYNOPSIS
tred [ files ] DESCRIPTION
tred computes the transitive reduction of directed graphs, and prints the resulting graphs to standard output. This removes edges implied by transitivity. Nodes and subgraphs are not otherwise affected. The ``meaning'' and validity of the reduced graphs is application depen- dent. tred is particularly useful as a preprocessor to dot to reduce clutter in dense layouts. Undirected graphs are silently ignored. 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. BUGS
Using bitmaps internally would substantially decrease running time. DIAGNOSTICS
If a graph has cycles, its transitive reduction is not uniquely defined. In this case tred emits a warning. AUTHORS
Stephen C. North <north@research.att.com> Emden R. Gansner <erg@research.att.com> SEE ALSO
gc(1), dot(1), acyclic(1), gvpr(1), gvcolor(1), ccomps(1), sccmap(1), libgraph(3) 21 March 2001 TRED(1)