While posting to Facebook through the Graph API, I get GraphAPIError: (#506) Duplicate status message. Where is the documentation for this? I've checked http://wiki.developers.facebook.com/index.php/Error_codes and it is not listed. I can guess that it has something to do with duplicate posts but what are the exact specs for causing this...
While this may look like homework, I assure you it's not. It stems from some homework assignment I did, though. Let's call an undirected graph without self-edges "cubic" if every vertex has degree exactly three. Given a positive integer N I'd like to generate a random cubic graph on N vertices. I'd like for it to have uniform probabilit...
I have a site written in PHP. It currently uses MySQL for all of its database needs (I'm open to additional DB technologies). The system's content is interrelated. These relationships can be represented as a graph where vertices are pieces of content and edges are the relationships. I need to be able to traverse that graph. In particu...
Hi, I want to find all the cycles in a directed graph. Starting Depth-first search from one node will find some cycles(finding back-edges). So, i applied dfs to all the nodes in the graph(i.e. each time the root is a different node). I am able to get all the cycles using this(by eliminating duplicate ones). But, i am not sure whether thi...
Does any one know of any good javascript 3d graphing utility? I know that every site ever recommends Canvas 3d Graph but it is actually quite limiting. For one it only allows graphing with datasets that are within the 1000. Though it does have some capability (with a bit of code modifying) to graph data that are a bit out of its range, n...
Hello! The problem is the following: Given is a set of points P on a 2-dimensional plane. Each with two points (p, q) are connected by an edge, if a circle with the diameter pq exists, which does NOT contain any other points from P and if p and q are on the circumcircle. (so p and q are the ending points of the diameter of the circle)...
Hello everyone, I know this question is more of a discussion than an actual question but I believe some results could come up by listening to other people's opinions. I was wondering if there's any point in visualizing multigraphs. I mean is there a practical application in which you'd actually want a multigraph visualized and in extend...
hello im looking for Qt graph widgets that are free something like qwt.sourceforge.net/ ...
I have written a mathematical software that is able to plot graphs (among other things). First it creates the graph itself, i.e. a set (or list, call it whatever you want) of points { (x0, y0), (x1, y1), ..., (xn, yn) }, and then lines are drawn between these points. On-screen, using either Windows GDI or OpenGL, it looks great, if onl...
<?php require 'facebook.php'; // Create our Application instance. $facebook = new Facebook(array( 'appId' => '130407366991766', 'secret' => 'f692cb73889096ca0835a55bc0a82c34', 'cookie' => true, )); // We may or may not have this data based on a $_GET or $_COOKIE based session. // // If we get a session here, it means we found ...
How can i get all the Events a Page have created? I've tried the following: https://graph.facebook.com/PAGEID/events But i don't get any data back. Can someone help me? Thanks in advance ...
TLDR: I am just starting to look into Jquery Flot have used it before but very basically. Was wondering is it possible to reshape the Jquery Flot graph or is it hardcoded to be square. Details: I am looking to create a circle if that is not physically possible. Is there a way I could go about combining 2-4 graphs for example to make a...
I know for sure that this is a simple directed graph. But I cannot say that this is a ring graph/network, because node 3 has a degree of 4. But as I imagine this, you cannot go to node 7 from node 3 if the preceding node is node 2, and you cannot go to node 4 from node 3 if the preceding node is node 6. That means the only way to travers...
I use the JUNG API to calculate shortest paths between several nodes in medium large graphs (20 to 100 nodes). Right now I'm iterating over my nodes and use the simple 'ShortetsPath' function to calculate the shortest path for two nodes. All the shortest paths are put in an ArrayList. UnweightedShortestPath<Vertex, SEdge> dist = new Unw...
This is the dijkstra structure i am using :(however the MAXV(which is maximum number of vertices is maximum at 500 and every time i try to change it to something more than this it generates and error when running ) -I want to use this way to represent a graph with 10000 vertices, does anyone know how to optimize it ? #include<iostream>...
Hey all, While optimizing performance of an app of mine, I ran across a huge performance bottleneck in few lines of (Python) code. I have N tokens. each token has a value assigned to it. Some of the tokens contradict (e.g. tokens 8 and 12 cannot "live together"). My job is to find the k-best token-groups. The value of a group of token...
Hi there I'm programming a debate-graph for my bachelor thesis with Raphael JS. point is, users can add nodes to the graph. eventually the graph gets really big and the canvas is still the same size. the canvas (in raphael js: paper) is inside another div with "overflow: scroll;", so lets ignore screen real estate so is there a way tha...
This Code is a code i built from the algorithm design manual book but i can't make it compile cause i've got little experience with pointers i think that's the main reason i think i can't compile it : And if someone can change a little bit in the djikstra to make it through heap with the current configuration. PLEASE HELP. #include<ios...
I am aware that Dijkstra's algorithm can find the minimum distance between two nodes (or in case of a metro - stations). My question though concerns finding the minimum number of transfers between two stations. Moreover, out of all the minimum transfer paths I want the one with the shortest time. Now in order to find a minimum-transf...
I want to be able to query a database so that I can find out which pages on a web site users visit before registering. I was planning on using a graph database - neo4j probably - but I can't decide how the data should be represented. Each user has an ID and can make multiple visits, each with their own ID. Obviously each page is identi...