graph-visualization

(Visual) C++ world. I have a tree structure, want to visualize it. More specifically: I have a tree data. I want the library that processes this data and computes coordinates (in any logical coordinate space, say 2000x2000 logical pixels) for each nodes, AND for each lines connecting them. Line connecting the two nodes might not be a simple straight line, it might be curve or some sort of path consisting of straight line segments. Ideally I'd like the line defining path to be calculated for the given tree nodes' coordinates as well, in case the user will drag and rearrange the nodes. Shortly,

I've been able to build a Force Directed Graph using a Force Layout. Most features work great but the one big issue I'm having is that, on starting the layout, it bounces all over the page (in and out of the canvas boundary) before settling to its location on the canvas. I've tried using alpha to control it but it doesn't seem to work: // Create a force layout and bind Nodes and Links var force = d3.layout.force() .charge(-1000) .nodes(nodeSet) .links(linkSet) .size([width/8, height/10]) .linkDistance( function(d) { if (width < height) { return width*1/3; } else { return height*1/3 } } ) //

Is there a mature, solid open-source graph visualization library implementation for SWT or AWT (I am referring to sets of vertices connected with edges, not charts and diagrams)? Which one do you use/recommend? I saw Zest for SWT, but could not find a Maven repository for it. Thank you. I recommend Prefuse: http://prefuse.org/ Have a look at JUNG ( http://jung.sourceforge.net/ ) If you don't want to use Zest (which I prefer), there is still Draw2D : Draw2D Also, there is a good tutorial on this available here: Display a UML Diagram using Draw2D Finally, I found this Maven repository:

I am writing a program to plot a graph from a distance matrix. It is working fine. Now I want a certain node and a certain edge to be of a particular color of my choice. How do I do that? The program is in Python and uses Networkx and Graphviz import networkx as nx import numpy as np import pickle from random import randint p_file = open('pickles/distance') Dist = pickle.load(p_file) p_file.close() p_file = open('pickles/names') Names = pickle.load(p_file) p_file.close() dt = [('len', float)] A = np.array(Dist)*5 A = A.view(dt) G = nx.from_numpy_matrix(A) G = nx.relabel_nodes(G, dict(zip(range

I have implemented a tree data structure in which every node holds (recursivly) a list of pointers to it's children. I am trying to calculate the (x,y) coordinates for visualizing the tree. I went through this article: http://gbook.org/projects/RadialTreeGraph.pdf Cut I can't figure out how to gest past the first level, i.e This is what I have written so far: for (int i = 0; i < GetDepth()+1; i++) { if (i == 0) { GetNodesInDepth(i).at(0)->SetXRadial(MIDDLE(m_nWidth)); GetNodesInDepth(i).at(0)->SetYRadial(MIDDLE(m_nHeight)); continue; } double dNodesInDepth = GetNodesInDepth(i).size(); double