I am modifying a graph implementation to compute the all pairs shortest path matrix using Floyd's algorithm. The graph has both adjacency linked list and matrix implementations. For now I am using adjacency matrix because it its needed for this algorithm. abstract public class GraphMatrix<V,E> extends AbstractStructure<V> implements Gr...
While doing software development I periodically come across the need to draw some graphs for my own use. Sometimes they illustrate relationships in a DB, sometimes they illustrate relationships of code files or classes, other times there are other objects... Anyway, the basic need is the same - I've got some set of nodes & edges that I w...
Before the Floyd–Warshall/Dijkstra replies flood comes in please let me explain the situation as i'm sure either algorithm can be tuned for this case, and it has to be as this is not a toy example program (mind you, in java so have to keep it manageable memory-wise) What i have is a web graph generated from node 0 to node n, node 3 cann...
How to plot negative values on graph in core plot. I am able to draw lines with positive decimal values but in case of negative values my graph shows nothing neither on axis nor on graph. Please suggest any examples or any sample code would work. TIA ...
Hi, I need to plot a 2 argument function (so I need a 3D plot) - ideally Mathematica style with nice colours for different values, which I will then use in a Latex document. I would prefer to get a vector output (i.e. EPS), so that it prints nicely. Please note that I will not display it on the screen (my app runs as a batch job). ...
Hi! I'm playing arround with a Genetic Algorithm in which I want to evolve graphs. Do you know a way to apply crossover and mutation when the chromosomes are graphs? Or am I missing a coding for the graphs that let me apply "regular" crossover and mutation over bit strings? thanks a lot! Any help, even if it is not directly related to...
I've been thrown into a large Fortran project with a large number of source files. I need to contribute to this project and it would seem prudent that I first understand the source. As a first step, I'd like to visualize the interdependences between the various source files, i.e. which source files need which modules. As far as I can t...
I have the adjacency list of a large graph stored in a table. v1 | v2 1 | 2 1 | 3 1 | 4 2 | 5 3 | 5 3 | 6 4 | 7 7 | 9 5 | 10 I am trying to extract the graph 2-hops away from say vertex 1 so that it returns all the edges from the above list except (7,9) and (5,10). I managed this: SELECT * FROM stub_graph WHERE v1...
Seems like there should be a method in networkx to export the json graph format, but I don't see it. I imagine this should be easy to do with nx.to_dict_of_dicts(), but would require a bit of manipulation. Anyone know of a simple and elegant solution? ...
Is there any opensourse, free set of components for creating Flex mxml graphs? like aviary Peacock style ones with at least Drag, drop, and connect generators so each graph element could have or something like that. Framework should be opensource (like GPL, LGPL etc) BTW: I found one wary bacic made by Erno Aapa with Degrafa ...
Problem: There appear to be many tools for visualizing graph structures, but none of the ones I've seen so far seem to have the feature of "nesting". The WireIt library (apparently inspired by Yahoo Pipes) looks very promising, but it seems to lack this concept of nesting. To explain what I am thinking of, consider a Company Org Chart ...
Which tool should I use in order to create a revision tree for a whole svn repository on linux. It's going to be like a visualization of every action made on that repository. ...
I have tried the following approach: First I do edge contraction for all the edges in the given set of edges to form a modified graph. Then I calculate the total number of spanning trees, using the matrix tree theorem, from the modified graph. I want to know if this method is correct and if there are some other better methods. ...
I am trying to do edge contraction on a graph. n is the number of vertices in the graph. The vector f containing pairs of vertices representing an edge contains the edges which are to be contracted. The graph does not contain any self loops. Please point out any logical mistakes if any in the code. If the method is entirely wrong then...
Hello, I would like to include images (not only text) inside the nodes of a DOT-langage graph. Is it possible? I didn't find any example concerning it. Thanks. ...
Good morning, I would like to create a grouped stacked bar chart that looks like this: http://rookery9.aviary.com.s3.amazonaws.com/4419000/4419489_3ed2_625x625.jpg Jan represents Jan 2009 vs 2010 and Feb represents Feb 2009 vs 2010 Either .net chart controls (preferred) or any other tool is fine. Thanks! ...
What would be the optimal way of clustering nodes after cutting a MST with a maximum edge-length? My output from MST edge-length cut is a 2xN array where each element is an integer. The integers are the node identifiers that describe the edges. An example of the output would is given below: >>> print array[0:3] [[ 0 1] [ 0 2] [...
I'm working on a charting algorithm that will give me a set n array of y axis values I would use on my graph. The main problem is that I also want to calculate the number of number of steps to use and also use nice numbers for them. It must be able to take integers and doubles and be able to handle small ranges (under 1) and large rang...
So What Im trying to do is populate an Extjs line graph. Ive created a JSON store that pulls json from a remote page and for some reason my graph is not being populated. Heres my Ext code: Ext.onReady(function(){ var store = new Ext.data.JsonStore({ autoDestroy: true, url: 'http://myURL.com', storeId: 'graphStore', roo...
So I really like data structures and I've been working on a class library that implements different types of graphs in different ways. One of the stumbling blocks I've had is trying to easily combine specific features of different types of graphs. To clarify, let's say I have an interface named IGraph<T>, where T is the data that each ...