Hello, I m sorry this obviously is not a programming questions, hope it s fine. Can you please recommend a book on graph theory? Not a very complicated book, with good explanations and examples. I have already read CLRS and Algorithm Manual. Thanks. ...
First time poster. I'd like to analyze and understand a certain Java app and I think a call graph would be very useful. How do I generate one? I'm using Eclipse. Thanks. ...
We have a one-question checkbox (multiple selection) survey in SharePoint. When selecting "Show a graphical summary of responses" in SharePoint, it tabulates the different combinations of responses as distinct answers as opposed to totaling the number of each option selected. Is there a way to show the total of each option selected ...
From this Wikipedia article: http://en.wikipedia.org/wiki/Hamiltonian_path_problem A randomized algorithm for Hamiltonian path that is fast on most graphs is the following: Start from a random vertex, and continue if there is a neighbor not visited. If there are no more unvisited neighbors, and the path formed isn't Hami...
I want to develop a java desktop application that takes some inputs from the user and store it in a database. After that, when user clicks on a button (say display) it displays the information, entered by him earlier, in a flowchart like format. Can I display that information in the form of flowcharts? ...
How to obtain all the subgraphs of a fixed size from a graph, in pseudocode? (brute force) Without external libraries if possible. Thanks! ...
I found a charts tutorial, but couldn't find any for graphs like this. Any ideas on what should I use? ...
I made a page to plot average snowdepth by week number. Now that we entered 2010, week 1 my graph stretches the interval on the x-axis (yearweek). What I want is the weeknumber on the x-axis (51,52,1,2 etc), and a fixed intervalwidth. Anyone know how to do that? example <script id="source" language="javascript" type="text/javascript"...
I have an old AVerTV USB2.0 PLUS. I have its old drivers and old program for working with it. I want to write my own program (or at least simple graph for GraphEdit) to use this TV device in Windows 7. So for the beginning I want to see some examples of creating DS filters for AVerTV's (model does not matter in general I hope) . So my q...
I am implementing DFS on a weighted directed graph in the following way: public class DFSonWeightedDirectedGraph { private static final String START = "A"; private static final String END = "C"; private int pathLength = 0; private int stops = 0; public static void main(String[] args) { //this is a direc...
Given a grid of open spots, and a certain number of tiles to place in those spots, what function f(openSpots, tilesToPlace) will give you the number of continuous paths you can form? Continuous paths are placements of the tiles such that each tile shares an edge with another. (Only corners touching is not good enough. So (0, 1) and (0, ...
All, I was wondering if you have any suggestions for the best graphing library available for PHP. I plan to accomplish the following things: It should be scalable to support complex graphing plotting. It should support forecasting of data. It should be easy to implement and should be flexible to extend feature set. It should be option...
Consider a card game along the lines of Tower Solitaire, Tripeaks, or Fairway Solitaire: the table consists of some number of cards which are immediately available, each of which might be covering other cards underneath it (blocking them from being played). You have one "foundation" card, and you can remove a card from the table if it's ...
I want to build an undirected graph in Django. I have built an edge model with two foreign keys (first,second) to the node class, but there is a conflict with the related_name. I can use first_set and second_set, but since the graph is undirected, it doesn't matter if it is being liked to or from. What is the recommended way to deal w...
I am trying to understand why Prim and Kruskal have different time complexities when it comes to sparse and dense graphs. After using a couple of applets that demonstrate how each works, I am still left a little confused about how the density of the graph affects the algorithms. I hope someone could give me a nudge in the right directio...
Does anyone know how to display the date in flot based on timestamp <script id="source" language="javascript" type="text/javascript"> $(function () { var d1 = [ [1262818800,100],[1262732400,100],[1262646000,100],[1262559600,100],[1262473200,100],[1262386800,100],[1262300400,100],[1262214000,100],[1262127600,100],[1262041200,100],[12619...
I am gathering data from a website. I estimate to get 10.000 datapoints (time - value) multipled by seven - over time. That is way to much. Both for storing and plotting it in a real time alike graph (through jQuery flot). I'm looking for a text dealing with this sort of problems. To be more precise: algorithms, statistical math for find...
What is GOP and does it relate to either the maths or data structure definitions of graphs? How does it compare to aop, oop, functional, logic or other paradigms? ...
I am using depth-first search to identify paths in a directed weighted graph, while revisiting nodes that belong to a cycle, and setting cutoff conditions based on total distance traveled, or stops from the source node. As I understand, with recursion an explicit stack structure is not required for depth first search, so I was wonderin...
I have data in the below form, which makes up a bipartite network. A1 - B1 A2 - B2 A2 - B1 A3 - B1 A4 - B2 A5 - B3 A6 - B3 A7 - B3 A7 - B3 A8 - B4 A9 - B3 What I would like to do is write something (ideally in python or C) or use an existing library to identify individual communities within the data. For instance A1,A2,A3,A4 are all ...