graph-visualization

问题 I am very close to being able to generate a family tree that doesn't look terrible, but I'm running into the following problem. //file: tree.dot digraph { edge [dir=none]; node [ fillcolor="black",fixedsize=true,shape=box, style="rounded,filled",width=2.0 ]; splines=ortho; // GEN -01 { rank=same; rankdir=LR; "Grandfather" [regular=0]; m0002 [ label="",shape=diamond,regular=0,height=0.25, width=0.25,style="filled", ]; "Grandmother" [regular=0]; { rank=same; rankdir=LR; "Grandfather" -> m0002 -

问题 I need to visualize a tree which I have gotten from an ANTLR parser and written to a .dot file by catching console output that the ANLR dot generator produces. MyDOTTreeGenerator generator = new MyDOTTreeGenerator(); PrintStream old = System.out; try { System.setOut(new PrintStream(new FileOutputStream(graphFile))); } catch (FileNotFoundException e) { e.printStackTrace(); } System.out.println(generator.toDOT(root)); System.out.flush(); System.setOut(old); Question is: 1. Is there a way to

问题 I want to use Prefuse to visualise a graph. I followed their tutorial and tried their sample application. Its sourcecode can be found here However, even if I simply copy the full code, the resulting graph does not look as displayed in the tutorial. It is only half visible, stuck in JPanel's upper left corner. Some parts of it are missing becuase they would have to be displayed outside the panel. I tried with some graphs of my own, but I keep running into the same phenomenon. I suppose this is

问题 In this graph: Rendered using Graphviz/Dot, the red edge connects two nodes, whereas the other edges connect ports inside the nodes. The nodes have HTML labels, and the TD s for the inputs and outputs have a PORT attribute. Is there a way to make Dot move the red node "out of the way", that is to the left or to the right, possibly curved, so that it does not go over the black edges. It is for an automatically generated graph that can contain more than two nodes, not necessarily all vertically

问题 Some background: I'm looking at the possibility of using Git as a data storage layer. Basically I need to keep all versions of some XML files which describe application state. The users needs a "Time Machine" to be able to revert to previous states, as well as branch off previous states etc. This will be hidden behind a service layer, but I am looking at using Git at the back end. I need to present the evolution of the application's state over time, so I want to build a network diagram

问题 I am trying to get a PyLDAvis graph that looks like the 2 shown in this link, that you can see right away (Intertopic Distance Map and Top 30 Most Salient Terms): http://nbviewer.jupyter.org/github/bmabey/hacker_news_topic_modelling/blob/master/HN%20Topic%20Model%20Talk.ipynb My code does display it but only partially, I can only see 1 cluster on the left and like 5-6 terms on the right, the rest gets cut off (there should be many clusters and 30 words shown). This is the code I have: import

问题 I tried to use networkx in python to turn an adjacent matrix into a graph. My "weighted" graph has about 8000 nodes and 14000 edges. Is there a great layout form or other packages, tools to make my graph become more beautiful? I hope the outcome is that the edge weight higher the nodes become closer. So that I could analyze the cluster nodes. I had tried all the layout provided in networkx document. I also tried to use gephi and it still a little bit not satisfied with my ideal. This is how

问题 I tried to use networkx in python to turn an adjacent matrix into a graph. My "weighted" graph has about 8000 nodes and 14000 edges. Is there a great layout form or other packages, tools to make my graph become more beautiful? I hope the outcome is that the edge weight higher the nodes become closer. So that I could analyze the cluster nodes. I had tried all the layout provided in networkx document. I also tried to use gephi and it still a little bit not satisfied with my ideal. This is how

问题 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)

问题 I've been looking around for solutions to my question, but nothing does exactly what I want. What I want to do is save a whole JUNG graph (with custom vertex and edge rendering) to an image (PNG or JPEG). When I save the VisualizationViewer to a BufferedImage, it only takes the visible part. I want to save the whole graph, so that's not an option. Does anyone have an idea on how to render my whole graph to an image? Thanks in advance! 回答1: I finally found the solution to my problem, using a