I'm trying to position entities visualy to show their relationships to each other. It looks like for automatic graph layout, the spring algorithm would suit my needs. I'd like to implement this in silverlight using c#, so I'm looking for code samples, or links to good explanations of the theory. Any help appreciated ...
Does anyone know of a web-based framework for interactively editing graphs (nodes and edges)? Flash or Javascript is fine. I'm looking for something like GEF in Eclipse, or JGraph, or the NetBeans graph framework. Thanks! Just to be clear, I'm interested in editing tools for mathematical graphs (nodes and edges), not charting tools. ...
I'm trying to create my own implementation of a puzzle game. To create my game board, I need to traverse each square in my array once and only once. The traversal needs to be linked to an adjacent neighbor (horizontal, vertical or diagonal). I'm using an array structure of the form: board[n,m] = byte Each bit of the byte represe...
I was looking at what the guys in the Mario AI Competition have been doing and some of them have built some pretty neat Mario bots utilizing the A* (A-Star) Pathing Algorithm. (Video of Mario A* Bot In Action) My question is, how does A-Star compare with Dijkstra? Looking over them, they seem similar. Why would someone use one ove...
I have a custom file format for graphs which looks like this: node1.link1 : node2 node1.attribute1 : an_attribute_for_node1 node2.my_attribute1 : an_attribute_for_node2 (there is nothing special about the attributes names, an attribute is a link iff one can find its value at the left of a dot. So node2 is a link, because there is a l...
Howto break a flat but sparsely connected graphviz graph into multiple rows? Graphviz yields a graph of about 4 ranks, but over 9000 nodes wide. However since the graph is sparsely connected we could break it in to rows, for example each 1000 nodes, and thus make it fit on nine rows one page. How can this be done? Not looking for unfl...
Does .NET 3.5 provide any build-in support for charts and graphs for Windows Forms applications? ...
I have a graph which contains an unknown number of disconnected subgraphs. What's a good algorithm (or Java library) to find them all? ...
I have been working on a project that requires a bar graph to be populated with price results. The chart displays the number of items within a given price range. For instance, if on amazon there are 9 items within the price range of $0-$10 the x-axis would display $0-$10 and the y-axis would be populated with a value of 9. My bar graph...
I'm looking for a library that will layout and display graphs (i.e. network diagrams, not charts) in 3D, with some interactivity like selecting and dragging nodes, rotating the display etc. I would like to do this in a web page so Javascript or Flash are preferable, I'd also consider Java. Having looked myself I realise the options are ...
I have written code that opens 16 figures at once. Currently they all open as separate graphs. I'd like them to open all on the same page. Not the same graph. I want 16 separate graphs on a single page/window. Also for some reason the format of the numbins and defaultreallimits doesn't hold past figure 1. Do I need to use the subplo...
Hi, I'm using adjacency_list< vecS, vecS, bidirectionalS ... > extensively. I have so many graphs loaded at once that memory becomes an issue. I'm doing static program analysis and store the callgraph and flowgraphs of the disassembled binary in boost graphs. Thus I can have several ten thousand functions==flowgraphs and one gigantic ca...
The problem is I have 10 nodes(say) and there are some connections between them. Now I want to draw a visual graph depicting the above with circles as nodes and lines as connections between them. My problem is what is the algorithm for placement of nodes on screen, say we have drawn one circle, then the other circle should be drawn as no...
Hi all, I've got this small code that performs recording in java. I whish to add some sort of functionality to draw a visual presentation of this. How would you advise me to approach this? (I am very new to java ) I'd like the visual presentation to appear as a foreground of a current existing image. ...
How much does the garbage collector affect performance when working with lots of objects in memory, how big is the memory allocation and dealocation overhead? Is it wise to use SBCL to do this or is better to build a small C library to connect trough FFI? ...
Okay, so this is a straight math question and I read up on meta that those need to be written to sound like programming questions. I'll do my best... So I have graph made in flot that shows the network usage (in bytes/sec) for the user. The data is 4 minutes apart when there is activity, and otherwise set at the start of the usage range...
I am trying to plot lattice type data with GGPLOT2 and then superimpose a normal distribution over the sample data to illustrate how far off normal the underlying data is. I would like to have the normal dist on top to have the same mean and stdev as the panel. here's an example: library(ggplot2) #make some example data dd<-data.fram...
I need to construct an undirected graph. I don't need it to do anything too fancy, but ideally it would work like this: structure UDG = UndirectedGraph val g = UDG.empty val g = UDG.addEdges(g, n1, [n2, n4, n7]) (* n1 is connected to n2, n4, and n7 *) val g = UDG.addEdge(g, n2, n3) UDG.connected(g, n2) (* returns [n1, n3] *) Is there...
Please explain How to derive formula for number of hamiltonian cycles in a complete undirected graph. at wikipedia it is given that it is (n-1)!/2 but when I calculated K3 has only one cycle and K4 has 5. Or I am wrong. Please elaborate ...
What is dynamic programming algorithm for finding a Hamiltonian cycle in a undirected graph? I have seen somewhere that there exists a algorithm with O(n*2^n) time complextity ...