i am looking for javascript/flash/java graphic lib. that able to render nicely a very complex relationship where one node is relate to another node etc. for example a--> b---> c b--> d,e,f any recommandation library? ...
I have a program with a graph whose nodes represent some processes, and the proccess computing time is the node's cost.This graph is maintainded in memory as a list of nodes and each nod has a list of parent and children, and his execution time. I must find the path with the minimum execution time. Each node can connect with any other...
I see grammar graphs on the websites for SQLite and JSON. What program can be used to generate these pretty pictures? ...
I have a set of 3 dimensional points. I want a quick query of the k nearest neighbours of any of these points. I know that a usual way of doing this is oct-tree, however I think that with the below described data structure the query would be much faster. I want a minimal graph on the points as vertices, which have the following proper...
I'm trying to build a sequence that determines the order to destroy objects. We can assume there are no cycles. If an object A uses an object B during its (A's) construction, then object B should still be available during object A's destruction. Thus the desired order of destruction is A, B. If another object C uses object B during its (...
Hi Friends, I have Created a Chart in Access forms and Exported it in Image Format.. Its Easily Done, but the Problem comes when after it.. I closes the Form.. It Shows a Pop-up Msg "The operation on the Chart object failed. The OLE server may not be registered. To register the OLE server, reinstall it. " Then I have done some chang...
I am currently writing a control (in C#) for displaying a set of tables and the relationships that exist between them. I got the basic control done, but would like to implement something similar to the "Auto-Arrange" feature provided by the diagramming component of SQL Express. What kind of algorithm does it follow to identify the opti...
ax.plot_date((dates, dates), (highs, lows), '-') I'm currently using this command to plot financial highs and lows using matplotlib. It works great, but I also need the option to remove the blank spaces in the x-axis left by days without market data, such as weekends and holidays. I have lists of dates, highs, lows, closes and opens....
The java Swing GUI im developing needs to plot a 2D graph based on the x and y coordinates generated in the program. Is there a Swing component for that? Or is there any other open source package for the purpose? Thanks in Advance.. ...
I am looking for any of the following (in order of preference): A Manhattan layout EdgeRenderer for prefuse. A Manhattan layout for prefuse. An algorithm to produce Manhattan layouts for hierarchical, directed acyclic graphs. An organizational chart implementation. Sample implementations include: NodeLinkTreeLayout (for prefuse) is...
For fun I'm learning about graph theory and I came across this problem. Given a set of vertices V, a set of edges E, and a weight for each edge in E, how can I efficiently construct a graph G such that: G is connected (all vertices are connected via some path) the sum of the weights of the edges is minimized Cheers! Edit: the edge...
I've just now started reading an Algorithms book that defined Graphs as follows: Graphs – which represent relationships between arbitrary pairs of objects. Figure 1.8(b) models a network of roads as a graph, where the vertices are cities and the edges are roads connecting pairs of cities. Graphs are likely the object in q...
Hi! I have to make a method for making a list with all the paths in a graph.My graph has only one start node and one finish node. Each node has a list whith its children and other list whith its parents. I have to make another list containing all the paths (each of them in another list) Any suggestion?? ...
Here is the problem: I have to find a path from the starting point to the destination with following considerations. In the given graph a point could be either (1) A Checkpoint--> this point must be there in the final path calculated (2) A Mine--> this point should not be there in the final path calculated (3) A neutral point--> thi...
I need to develop a graph database in python (I would enjoy if anybody can join me in the development. I already have a bit of code, but I would gladly discuss about it). I did my research on the internet. in Java, neo4j is a candidate, but I was not able to find anything about actual disk storage. In python, there are many graph data m...
Has anyone worked with JFreeChart-open source library for plotting xy plots? Could someone post an example of how to create an xy plot dynamically with the x and y values generated from the program? And where can i get a turorial doc or something of that kind to know about how to use the JFreeChart for developing applications? Thanks ...
Hi all, I'm trying to generate a graph for the statics of my site. I need a couple of them, one for the hours of a day, one for the days of a week, one for the weeks of a month and one for the months of a year. There are hits and unique visitors. It could look like: http://extjs.com/deploy/dev/examples/chart/charts.html - The last e...
I have got an undirected weighted connected graph. If I select one vertex I automatically select all the vertices connected directly with it. What will be the algorithm so that I am able to select all the vertices of the graph using minimum number of tries? In each try I select one vertex. For example for adjacency matrix a[][]={1,1,0,0,...
The following diagram illustrates a problem I have encountered creating a Manhattan diagram: Overlapping Lines The box surrounds most of the line [(tx,midy)-(sx,midy)] that has overlapped an existing line (represented by psegment in the code below). I have removed the overlapping arrow heads (and tails) and am a little stumped on how t...
Hi, Is there a graph algorithm that given a start(v) and an end(u) will find a shortest path through the given set of edges, but if u is a disconnected vertex, it will also determine the shortest path to add missing edges until u is no longer disconnected? I have a pixel matrix where lines are made of 255's(black) and 0's(white). lines...