Hi, I'm working on a project at the moment where I need to pick out the most common phrases in a huge body of text. For example say we have three sentences like the following: The dog jumped over the woman. The dog jumped into the car. The dog jumped up the stairs. From the above example I would want to extract "the dog jumped" as i...
I would like to round (0 decimals) the values on the x-axis of a flot graph. The x-axix show week numbers. Does anyone know how to do that? http://www.snowcams.eu/snowcondition/saas%20fee/998 ...
Hi! Who knows good graph layout engines with clear customization and managment? Flare is an cool one but it is written on Flex (may be you know how it can be customized without re-compilation and writing code?). I also know about JavaScript InfoVis Toolkit but it not good enough. ...
Hello, I have developed a GUI using ASP.NET 3.5 and C#.... Now at some places i need to display the data using graphs like pie or bar... I need to know how to start to do this...As in i was going through Crystal Reports, the there was something about MS charts...i need to know where can i read the tutorial and then implement it in my ...
Basically I am looking for a graph library that would have fine-grained locking around graph operations, so that different threads touching different parts of the graph could alter it simultaneously, and competing modifications could be blocked. I googled around a bit and can't find anything. Maybe this is too specific to my needs, but...
Probably a very newb C++ question. Say I have a class, vertex, with several properties and methods. I want to stuff a bunch of vertices into a queue, and have them ordered by a special property on the vertex class (doing a basic Dijkstra graph algo for school yes). I'm having some problems penetrating the C++ syntax however. Here is my ...
How can I find 2-approximate solution for a problem of determining a maximum subgraph with no cycles of an oriented graph? Subgraph is "maximum" if it contains the maximal number of edges amongst other graphs that bear the same property. 2-approximate means that we can build 2 times smaller graph than the optimal one. That's quite a b...
The graph is very large but undirected. Edges are unweighted.. In my implementation, I have to find the vertex with max degree and do deletion on both vertexes and edges... Linked list? ArrayList? Map? Which one is better for my implementation? ...
I have a huge directed graph: It consists of 1.6 million nodes and 30 million edges. I want the users to be able to find all the shortest connections (including incoming and outgoing edges) between two nodes of the graph (via a web interface). At the moment I have stored the graph in a PostgreSQL database. But that solution is not very e...
Hi, For a learning exercise, i'm wanting to create candlestick (stock) graphs for stocks using zedgraph. Now on google finance, i can get daily open-high-low-close data which is perfect for making these graphs, but i'm wanting to create intra-day graphs, eg open-high-low-close data for an hour (or 5 mins, or 1 min even). Is there any w...
I am applying the all-pairs shortest path algorithm (Floyd-Warshall) to this directed graph: The graph is represented by its adjacency matrix. The simple code looks like this: public class ShortestPath { public static void main(String[] args) { int x = Integer.MAX_VALUE; int [][] adj= { {0, 6, x, 6, 7}, ...
I'm trying to build an A* solver for a 15-square puzzle. The goal is to re-arrange the tiles so that they appear in their natural positions. You can only slide one tile at a time. Each possible state of the puzzle is a node in the search graph. For the h(x) function, I am using an aggregate sum, across all tiles, of the tile's dis...
I am looking for a javascript library which plots networks with the nodes arranged in a circle. There are some other good questions about javascript visualisation in general, but most of the things referenced seem to be quite heavyweight toolkits. I am looking for a simple API that lets me pass in an array of string pairs representing ...
I'm trying to build a Graphviz graph containing record vertices using QuickGraph. So far, I have this: var algo = new GraphvizAlgorithm<Entity, EntityEdge>(this); algo.CommonVertexFormat.Shape = GraphvizVertexShape.Record; algo.CommonVertexFormat.Style = GraphvizVertexStyle.Filled; algo.FormatVertex += new FormatVertexEventHandler<Entit...
How can I build an interference graph so I may use it in register allocation ? How do I determine live-ranges? ...
Hi, I have seen a facebook application in which clicking on a radio button renders a graph. As you can see below: I wanted to know whether there is any similar graph library through which i can generate the same graph in php. Thanks, Pankaj ...
Suggest an algorithm and data structure for solving the game Globs (http://www.deadwhale.com/play.php?game=131). It's pretty fun in a geeky kind of way. (MatrixFrog correctly points out this game is also known as FloodIt, and Smashery gave a solution 3 months ago in the link he cites below. All you dudes suggesting pruning/greedy with o...
Hi, I was wondering what would be the best way to implement undirected graphs (and hence graph traversal) on Google App Engine. I'm currently storing edges in the database as a list, i.e. class Relation(db.Model): connect = db.ListProperty(str, required=True) but this is notoriously inefficient. I'm aware of the directed graph qu...
I have a web application written with JavaServer Faces technology. The application takes n inputs and provides an output. I want the following functionality in my application. I want to have sliders for each of my inputs. I want the output to be depicted by a graph. So whenever I change the input values via a slider I want the chang...
I am trying to use this software called InfoGrid for a project that I am building. Can someone please point me to some basic getting started articles. I don't see any documentation on the site. Peopl with enough reputations, please edit the question and add the tag InfoGrid to this question. ...