I'm using Pmw.Blt.Graph to plot a line graph. I need to mark up this graph with additional data visualized in a way that Graph doesn't seem to be able to draw. (I thought I could use line_create's trace parameter to do it, but trace's behavior currently breaks when you change the axis mins and maxes, which I need to do.) Some possible...
Hey, Knowing an edge is defined by both initial and final vertices, How do you call edges coming from and to a vertex ? For now, I name those incoming and outgoing. Thanks. ...
I am taking an input, e.g. 4 1 3 1 2 2 4 First line is number of nodes, lines after that are the edges. I have to attempt to color the graph, and if I can't, I need to list a cycle in the graph that is causing the error. This is fine so far, except one of the graphs contains 1,000,000 nodes. Everytime I try to use it I get a Stack Ov...
Consider the following simple DAG: 1->2->3->4 And a table, #bar, describing this (I'm using SQL Server 2005): parent_id child_id 1 2 2 3 3 4 //... other edges, not connected to the subgraph above Now imagine that I have some other arbitrary criteria that select the first and last edges, i.e. 1->2 a...
I am wondering what other people have found to be the best graphing libraries/plug-ins/gems etc for a rails app. When I say best, I guess I mean ease of implementation and the ability to customize the graphs. I have previously used openflashchart2 and loved the overall look/effects it has, although customizing everything as required ...
Hi, I'm looking for a library to draw ASCII graphs (for use in a console) with Python. The graph is quite simple: it's only a flow chart for pipelines. I saw NetworkX and igraph, but didn't see a way to output to ascii. Do you have experience in this? Thanks a lot! Patrick EDIT 1: I actually found a library doing what I need, but i...
I'm rewriting a data-driven legacy application in Python. One of the primary tables is referred to as a "graph table", and does appear to be a directed graph, so I was exploring the NetworkX package to see whether it would make sense to use it for the graph table manipulations, and really implement it as a graph rather than a complicated...
In Windows, I am looking at generating professional graphs using any mainstream programming language (C#, VB.Net, Java, PERL, etc). The best free looking graphs I have found so far is Microsoft Chart Controls for .NET. What other graph controls/modules do you suggest? Note: Added free to the requirements. ...
I have a graph with n nodes as an adjacency matrix. Is it possible to detect a sink in less than O(n) time? If yes, how? If no, can you prove it? Sink: a node that has incoming edges from all other nodes and no outgoing edges. ...
As a keen windsurfer, I'm interested in how windy the next few weeks are going to be. To that end, I've been writing a little app to scrape a popular weather site (personal use only - not relaying the information or anything) and collate the data into a single graph so that I can easily see when's going to be worth heading out. I have t...
I'm working with Qt and QWt3D Plotting tools, and extending them to provide some 3-D and 2-D plotting functionality that I need, so I'm learning some OpenGL in the process. I am currently able to plot points using OpenGL, but only as circles (or "squares" by turning anti-aliasing off). These points act the way I like - i.e. they don't ...
Hi I'm trying to work out an algorithm for finding a path across a directed graph. It's not a conventional path and I can't find any references to anything like this being done already. I want to find the path which has the maximum minimum weight. I.e. If there are two paths with weights 10->1->10 and 2->2->2 then the second path is c...
Hello, Is there a good C# library for drawing/visualizing graphs? I'm talking about node-path visualization instead of line graphs or the like. (preferably native, not wrappers for pstricks or anything like that) Thank you ...
I have a bit of a strange question. Can anyone tell me where to find information about, or give me a little bit of an introduction to using shortest path algorithms that use a hill climbing approach? I understand the basics of both, but I can't put the two together. Wikipedia has an interesting part about solving the Travelling Sales Per...
UPDATED After more reading, the solution can be given with the following recurrence relation: (a) When i = 1 and j = 2, l(i; j) = dist(pi; pj ) (b) When i < j - 1; l(i; j) = l(i; j - 1) + dist(pj-1; pj) (c) When i = j - 1 and j > 2, min 1<=k<i (l(k; i) + dist(pk; pj )) This is now starting to make sense, except for part C. How would ...
This is kind of more generic question, isn't language-specific. More about idea and algorithm to use. The system is as follows: It registers small loans between groups of friends. Alice and Bill are going to lunch, Bill's card isn't working, so Alice pays for his meal, $10. The next day Bill and Charles meet each other on a railway sta...
How can I implement a bipartite matching algorithm (probably based on a max-flow algorithm) in C or C++ ? To be specific, I have this input in a file: (1,3) (1,5) (2,5) (M,F) --> where M represents id of MALE and F is id of FEMALE. I need to find the maximum number of matches and show matched couples. Like: matches: 1&3 , 2&5 I h...
Ok, so here goes: I'm building a thesaurus using a HashMap <String,ArrayList<String>> to hold words and their synonyms (this data structure is required). For the purpose of the assignment, the synonymity relation is considered transitive. (We can imagine the thesaurus as a graph). What I'm trying to accomplish is to print this graph in ...
I have reduced my problem to finding the minimal spanning tree in the graph. But I want to have one more constraint which is that the total degree for each vertex shouldnt exceed a certain constant factor. How do I model my problem? Is MST the wrong path? Do you know any algorithms that will help me? One more problem: My graph has dup...
I have received the task to make a social graph, where, with one user in the center, it shows the connections he has. But before we can reach that, our focus is how we can determine the shortest path between 2 users. I found some algorithm to do it, but it seems that it takes a lot of time, and because it's about social links, we are loo...