Per the new profile/fan page tab rule that eliminates the iFrame option, is there a way to dynamically generate content for a given tab? I've seen methods that wrap a canvas app (but requires a user to click to load content), but I want to show updated content thats managed on my servers. I thought you could also update the FBML using th...
Hi all I there a way where by I can define the colours of bubbles in a motion chart provided by Google visualization API ? I do not want to use the default colour scheme. Thank you in advance. ...
I want to generate a BFS forest of of a DAG (Direct Acyclic Graph). This means my Tree class needs to be a general tree and not a binary tree (in other words, I can't know the number of children a node will have ahead of time when I am generating a forest). Most of the code is written and shown below, however I lack one line that, for th...
I've been looking for a good open-source tool for creating graphs in PHP, and pChart is looking like a great candidate. One need I have is to be able to click on certain elements of the graph, like a category label or an individual bar, to drill-down into the data, and display new data and new graphs on a new page. Is this something th...
In terms of runtime, what is the best known transitive closure algorithm for directed graphs? I am currently using Warshall's algorithm but its O(n^3). Although, due to the graph representation my implementation does slightly better (instead of checking all edges, it only checks all out going edges). Is there any transitive closure algo...
I have a large directed, acylic graph (DAG) from which I would like to efficiently draw a sample node according to the following criteria: I specify a fixed node A that must never be sampled Nodes that directly or indirectly refer to A are never sampled All other nodes are sampled with equal probability Nodes are stored as objects wi...
I have a large directed acyclic graph that I would like to visualize in a bitmap image. Ideally I'd like to have all the root nodes at the top of the image, and all of the leaf nodes at the bottom, i.e. the graph edges are all pointing in a downwards direction. Is there a good algorithm for working out the coordinates of all the nodes ...
Currently, I am working on a folder of Excel which consist of database (number) size of 1.34GB 63 files and growing. I can continue to work in Excel but I have to separate one large piece of file into several sub-files which is not very convenience and sometimes confusing when it come to calculation, analysis and graphic. I wonder if th...
Hello, I am interested in running Newman's modularity clustering algorithm on a large graph. If you can point me to a library (or R package, etc) that implements it I would be most grateful. best ~lara ...
Say I have a set (or graph) which is partitioned into groups. I am interested to find the number of transitions between two partitions, where a transition involves taking an element out of one partition and moving it into another (or singleton partition by itself) For example there is one transition between partitions 1 2 | 3 and 1 |...
As you know finding maximum independent set is NP. Is there an algorithm to find out whether a given graph has an Independent set of at least k vertices? Note that we don't want to find it. We just want to find out if such thing exists. ...
I'm trying to find the shortest path between two maxima on a discrete energy landscape whereby the shortest path is that which reduces the least in height over the course of the total path. Probably maximum energy path is more correct terminology, but in other words even if a path travels a long distance around the landscape but does no...
Hello everyone, Currently I completed my project using with CorePlot. But I have problem, when I copy my project to another folder, prepare to build before distribution, I have one problem: CorePlot-CocoaTouch.h: No such file or directory I did my project import Core-Plot like the way with this link: http://www.switchonthecode.co...
Currently im faced with the following problem: I have a script that searches through a specific directory that contains documents. Each document is assigned a number within the filename. Within each document are numbers that also represent another document (filename). How can I create a web that shows what documents lead to what? Any h...
I'm writing a class in Java to represent a Graph data structure. This is specific to an undirected, unweighted graph and it's purpose is mainly for edge testing (is node A connected to node B, either directly or indirectly). I need help implementing the indirectEdgeTest method. In the code below, I've only commented this method and I'...
I am using Dijkstra algorithm in a program.suppose i have a graph with vertices and edges.if we imaging all the edges starting from source vertex "a" are as below a-->b a-->c and a-->d and all the edges ending to vertex "f" are : b-->f m-->f e-->f w-->f what i need is i know from beginning that i want the edge a-->b as my starting edg...
The first part of the problem is that I don't know if there's a specific name for a system like this :) In my app I need a system to give the user the ability to interconnect object-properties; objects can have inputs and outputs, and inputs of one object can be connected to outputs of other objects. Optionally type-converters can be us...
I have a stacked areaplot made with ggplot2: dists.med.areaplot<-qplot(starttime,value,fill=dists,facets=~groupname, geom='area',data=MDist.median, stat='identity') + labs(y='median distances', x='time(s)', fill='Distance Types')+ opts(title=subt) + scale_fill_brewer(type='seq') + facet_wrap(~groupname, ncol=2) + g...
I have a large (100,000+ nodes) Directed Acyclic Graph (DAG) and would like to run a "visitor" type function on each node in order, where order is defined by the arrows in the graph. i.e. all parents of a node are guaranteed to be visited before the node itself. If two nodes do not refer to each other directly or indirectly, then I don'...
In the Lemon C++ Graph Library, given a node in an undirected graph say, how does one find other nodes that are edge connected? ...