I want to draw a map some cities in a software that I am designing. I want to know the algorithm for placement of circular nodes on screen (so they dont overlap each other) Please explain in relation to JAVA GUI programming if possible ...
I've written an algorithm which calculates and stores all paths of a DAG, and it works nicely on small graphs - but now i'm looking to improve it's efficiency to run over larger graphs. The core logic of the algorithm is in createSF() and makePathList() below, the other methods are helpers - I can see that append is a bottleneck. Howeve...
I have an application which updates a variable about between 5 to 50 times a second and I am looking for some way of drawing a continuous XY plot of this change in real-time. Though JFreeChart is not recommended for such a high update rate, many users still say that it works for them. I've tried using this demo and modified it to displa...
Hi, Is there a way to display the Vertical Axis outside the graph? I need the limits of the graph to be displayed between the vertical axis, without overlapping the series over the graph. See that screenshot of what I have: I need to get something like: Or I should create a custom axis renderer component that get data from this g...
I have a requirement to graphically depict relationships between a set of objects as well as their types in a PHP application. The relatinships would be previously generated. I am only looking for a tool, preferably free, that will display the nodes and their relations. I am open to PHP or JavaScript or any thing that will work as long...
Just for kind of "fun" I'm developing almost every algorithm (if possible) shown in the book Introduction to Algorithms (Cormen) in C. I've reached the graphs chapters and I'm not sure how to design my functions, but first take a look at my data structures (hope this will make clear my question). typedef struct s_multi_matrix { ...
There are already a couple of questions on finding cycles, but I did not find a solution in SQL (MSSQL preferred). The tables would be Node (NodeID INT) and Edge (EdgeID INT, NodeID1 INT, NodeID2 INT) What would be a well-performing solution to find cycles in a directed graph? ...
I implemented a depth-first-search in c# based on information I found on the net and old java books and I used the Node and NodeList and Graph from the msdn site. How can one modify the DFS or BFS to check for particular weight? ...
Is there another way to calculate the shortest path for a near complete graph other than Dijkstra? I have about 8,000 nodes and about 18 million edges. I've gone through the thread "a to b on map" and decided to use Dijkstra. I wrote my script in Perl using the Boost::Graph library. But the result isn't what I expected. It took about 10+...
Hello, I'm looking for a "nice numbers" algorithm for determining the labels on a date/time value axis. I'm familar with Paul Heckbert's Nice Numbers algorithm (http://tinyurl.com/5gmk2c). I have a plot that displays time/date on the X axis and the user can zoom in and look at a smaller time frame. I'm looking for an algorithm that p...
I'm currently using Jung to draw graphs (I really mean graphs not charts!). The problem: Vertex and Edge Labels are overlapping with the Vertexes and the Edges. This leads into strange looking graphs: the "produces" label is overlapping with the vertex and the "60" edge-label is also overlapping with the vertex. Are there any possib...
I've inherited some Python code which is importing boost.graph and I'm having an issue setting up the following under Mac OS X Leopard (I believe this is what I need to install to get it working): http://osl.iu.edu/~dgregor/bgl-python/ According to the readme I need to build with bjam, but I see the following error: [matt@imac ~/Downl...
I'm looking for a general idea (and maybe some code example or at least pseudocode) Now, this is from a problem that someone gave me, or rather showed me, I don't have to solve it, but I did most of the questions anyway, the problem that I'm having is this: Let's say you have a directed weighted graph with the following nodes: AB5, BC4...
I'm building a CFG, and I'd like the exit node to always be at the bottom of the graph. Sometimes it happens naturally, sometimes it doesn't. Example: digraph G { 0; 1; 4; 5; 7; 8; 0 -> 4; 5 -> 7; 7 -> 8; 7 -> 1; 8 -> 5; 4 -> 7; } Draws (using dot): Node 1 is my exit node, I'd like that to be at the bottom....
I have a file with about a couple thousand entries in the form timestamp cmdType latency I want an automated script to graph all the points on a graph. What is the best way to write a script for creating the graph 9and in what language. No java)? I dont want to open excel and import points etc etc. ...
I've tried to use MSChart and ZedGraph but they both require Full Trust. Are there any other graphing libraries that I could use in Medium Trust webhosting? I have to note that I have very low ASP.NET knowledge so far. Thanks, Petr EDIT: At the end, ZedGraph seems to be running well in Medium Trust. I just added the following line to A...
Using Python's Networkx library, I created an undirected graph to represent a relationship network between various people. A snippet of my code is below: import networkx as nx def creategraph(filepath): G=nx.Graph() #All the various nodes and edges are added in this stretch of code. return G From what I understand, eac...
I'm looking for a simple and easy to integrate graph to display sales stats in a web application. I will basically supply it the name of the month, and a numerical number of sales in that month. I'd like it to then chart out a graph showing the stats. What's the best solution for this? I would prefer something attractive but still eas...
I'm trying to model a certain flow using graphviz, and I can't figure out how to model the following graph to share the same horizontal center digraph exmp { A -> B -> C -> D C -> E [constraint=false] A -> C [style="dotted", constraint=false] A -> D [style="dotted", constraint=false] B -> D [constraint=false] D -> A [...
I am working on an Eclipse RCP application which should display an internal hierarchical structure as a graph. The nodes of the graph should be positioned on different points of a background image but should offer drag support. The graph should be zoom-able possibly without resizing the nodes on the maps (layout zoom) while the backgroun...