There's a graph with a lot of nodes, and very few edges between them - the problem is assigning numbers to nodes, so that most nodes are from i to i+1 or otherwise close. My problem is about printing graph data nicely, but an algorithm just like that is part of pretty much every compiler (intermediate code is just a graph, produced obje...
I need a web-based tool which support for easy designing forms, role-based users for completing the forms and an embedded report and chart generator for analyzing data (if charts support drill-down its more useful). If the tool supports workflows It's good but lack of it doesn't matter. 1) What's the name for these kind of tools ? 2) Wha...
hello, I have data like this. file1 date1 1 76.09 date10 10 87.09 date11 11 89.89 date2 2 66.5 date3 3 78.89 date4 4 87.98 date5 5 57 date6 6 57.98 date7 7 34.32 date8 8 45.76 date9 9 34.99 file2 date1 1 82.45 date2 2 86.23 file3 date1 1 65.76 ...
There are three ways to store a graph in memory; - nodes as objects and edges as pointers - a matrix containing all edge weights between numbered node x and node y - a list of edges between numbered nodes I know how to write all three, but I'm not sure I've thought of all of the advantages and disadvantages of each. What are the ad...
I wrote a little graph visualizer class: public void simpleGraph(SparseMultigraph<Vertex,SEdge> graph, String name) { Layout<Vertex, SEdge> layout = new ISOMLayout(graph); layout.setSize(new Dimension(800,800)); BasicVisualizationServer<Vertex, SEdge> vv = new BasicVisualizationServer<Vertex, SEdge>(layout); vv.setP...
hello ! Can anyone give details about creating graphs like bars and lines in jsf ? which one is best ? I want graphs by taking data from database dynamically and should work offline.I want each and every step of installation and execution.please reply. ...
Anyone know where I can find a .net library for creating node graphs? Something that works like this, drag inputs on one to outputs on another. Regards _Eric ...
I'm trying to get Cacti to Graph DS1 interfaces on an Adtran Total Access Router. The IfInOctets on DS1 interfaces don't seem to increment. Adtran tech support is pretty useless, since none of them have ever used Cacti, apparently. However they have a gauge that tracks 15 minutes worth of octets for EFM groups in historical buckets. ...
I would like to store an object that has a name and some attribute and any kind of database and have another that that document relationship between between them Let say this Object A Object B Object C Object D A is related to B A is related to D B is related to C All relation have also attribute that give the relation order (uni (fr...
Is there a Lua library (or with Lua bindings) to build graphs (directed/undirected), with traversal algorithms, connectivity tests, and other basic graph operations? ...
Hi Guys, Those anyone know of a Scala Library for Graphs / Charts or an implementation of the Google Visualisation API. Cheers ...
Hi! Is there an algorithm that can check, in a directed graph, if a vertex, let's say V2, is reachable from a vertex V1, without traversing all the vertices? ...
I want a graph that looks similar to the example given in the lattice docs: #EXAMPLE GRAPH, not my data > barchart(yield ~ variety | site, data = barley, + groups = year, layout = c(1,6), stack = TRUE, + auto.key = list(points = FALSE, rectangles = TRUE, space = "right"), + ylab = "Barley Yield (bushels/acre)...
Given a range '1 to x', with a tick mark spacing 'y' such that 'y' < 'x/2', how do I draw the tick marks on a graph in log 10? Is there a generalized algorithm for this sort of thing? I should have added this is in c# for a custom control. ...
The graph is arguably the most versatile and valuable data structure of all. I can store single variables, lists, hashes etc., and of course graphs, with it. Given this, are there any languages that offer inline / native graph support and syntax? I can create variables, arrays, lists and hashes inline in Ruby, Python and Javascript, but...
I am working on compressing graphs. The graph is represented as an adjacency list i.e each node in graph maintains a list of adjacent nodes. The lists contain Node_IDs(4 byte integers) and they are ordered by popularity of each Node_ID(score). So, I end with up unsorted list of Node_ID numbers and I have to compress them while maintainin...
Hi I have strange issue with like buttons on my site. When I enter a page it shows up correctly, than after refresh it doesn't appears and I have javascript error FB.provide is not a function [Break on this error] FB.provide('Array',{indexOf:function(a...|c.hasOwnProperty(d))a(c[d],d,c);}}); Initialization and asynchronous including...
I have a set of data on which I need to perform a topological sort, with a few assumptions and constraints, and I was wondering if anyone knew an existing, efficient algorithm that would be appropriate for this. The data relationships are known to form a DAG (so no cycles to worry about). An edge from A to B indicates that A depends on...
I have a huge graph that I would like to process using many machines. I had like to compute if the graph diameter is higher than 50. How would I split the data and I would I write a parallel algorithm that can calculate it? (the return value is boolean) The graph diameter is the greatest distance between any pair of vertices ...
I have a Graph object (this is in Perl) for which I compute its transitive closure (i.e. for solving the all-pairs shortest paths problem). From this object, I am interested in computing: Shortest path from any vertices u -> v. Distance matrix for all vertices. General reachability questions. General graph features (density, etc). T...