graph-drawing

What algorithms are good for interactive/realtime graph-drawing?

What algorithms are good for interactive/realtime graph-drawing for live data and direct-manipulation? Failing that - what libraries do you use to draw graphs? Suggestions; Prefuse information-visualization toolkit any others? BTW- I mean graphs in the graph-theory sense - points and lines any language by live I mean the graph...

How to draw a graph in PHP?

Hey I want to draw a graph(Stdent mark distribution) in my site based on PHP. How can I do this? ...

Java implementation of planarity testing/planar embedding

Is there a free Java implementation of any of the major planarity testing algorithms? Boyer-Myrvold, de Fraysseix-Rosenstiehl, heck, even Hopcroft-Tarjan. I've been reading the papers and they all seem fairly complex, and I'd rather skip all the work of implementing them myself if someone else has already done so. ...

Winforms / GDI+ Draw curve for a chart

In my Winforms application I have a small chart. Nothing fancy just a bunch of x/y points I connect with lines. It would be nice to draw a curve instead of a lines to connect these points. But since mathematics was never my strong side I have no idea how to do that. Any kind of sample or advice would be helpful. ...

NSBezierPath / Line Intersection / flatten

Hello, I'm currently porting my jruby/java2d Graph Drawing/Layouting application to macruby/cocoa. Therefore I need to get the intersection point of an open NSBezierPath with an closed NSBezierPath. In java2d I used the following trick. I flattened both paths and did a simple line intersection test for each segment. So is there a sim...

Drawing a dynamic graph

I have a web application written with JavaServer Faces technology. The application takes n inputs and provides an output. I want the following functionality in my application. I want to have sliders for each of my inputs. I want the output to be depicted by a graph. So whenever I change the input values via a slider I want the chang...

Best Planar graph program

In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. What is the best open source program for drawing the planar graph with support of input nodes size and fixed drawing boundary region ...

Python: Simulate search algorithms in network models

I am using networkx package to draw power law graphs. I want to simulate a search algorithm on this graph and want to visually see the algorithm move from one node to another on the graph. How do I do that? ...

Improving graphviz layout

Hi, I have perfection paralysis when it comes to producing something graphic. If symmetries of the visual have not been fully explored, I have a harder time comprehending what is going on. I am a very visual learner as well, and I LOVE to simplify things that I just learned and draw them on paper. Graphviz is a nice tool to draw thing a...

Graphviz or Dynagraph for Graph-manipulation Program?

I'm looking into writing a program that will show a graph to the user. The graph will change over time (the user should be able to right-click on a graph item and ask for more detail, which will pop out new bits of the graph), and the user might be able to drag parts of the graph around. I would ideally also like to be able to specify th...

Drawing Directed Acyclic Graphs: Minimizing edge crossing?

Laying out the verticies in a DAG in a tree form (i.e. verticies with no in-edges on top, verticies dependent only on those on the next level, etc.) is rather simple without graph drawing algorithms such as Efficient Sugiyama. However, is there a simple algorithm to do this that minimizes edge crossing? (For some graphs, it may be imposs...

.NET implementation of planarity testing

Is there any .NET implementation of any planarity testing algorithm like Boyer-Myrvold's or anyone else? I looked through the web but I didn't manage to find ...

Automatically rotate a graph

I'm drawing graphs with force-directed layout, and the problem is that the created graphs are oriented randomly and unpredictably, which makes looking at them somewhat confusing. For example, suppose node A is a member of the two separate graphs G1 and G2. With force-directed layout, node A may end up on the left side of G1, but on the r...