I have a web app that adds an application to a users profile, and requests extended permissions. I can't seem to find if there is a way to use a script to remove the application from the users profile when they request to do so from my web app. I know they can remove the app when logged into Facebook, but I want to know if I can remove ...
I am doing a project that involves processing large, sparse graphs. Does anyone know of any publicly available data sets that can be processed into large graphs for testing? I'm looking for something like a Facebook friend network, or something a little smaller with the same flavor. ...
I have a non-weighted DAG graph. What I want to do is to find all the paths in a greedy way and the path should contain at least K nodes, and a given starting node. Is there any existing algorithm/implmentation that does that? For example I have the following graph: my %graph =(36=>[31],31=>[30,22],30=>[20],22=>[20,8],20=>[1],8=>[5],...
hi all, I am new to core plot SDK, implemented core plot in my app. i need to restrict -ve part of graph. i.e always i will have +ve values for graph((1,1),(10,15),(20,15)).i need horizontal , vertical scrolling for +ve part only.So i want to restrict remaining 3 parts of graph. I tried in all ways help less, so posted here. if any one a...
hi all, I am new to core plot SDK, implemented core plot in my app. i need to restrict -ve part of graph. i.e always i will have +ve values for graph((1,1),(10,15),(20,15)).i need horizontal , vertical scrolling for +ve part only.So i want to restrict remaining 3 parts of graph. I tried in all ways help less, so posted here. if any one a...
I have the following collection of nodes and edges. What I want to do is to find all the distinct graph from it. my %connections=(36=>[31],10=>[3,4],31=>[30,22],30=>[20],22=>[20,8],20=>[1],8=>[5],5=>[2],2=>[1,20], 3=>[7]); In this example it will yield: my %all_graph = { graph1 => {36=>[31],31=>[30,22],30=>[20],22=>[20,8],20=>[1...
Hi everyone, I've never designed a database before, but I've had experience programming in a few languages and assembler throughout college, as well as some web design, so I'm able to at least pick up what I need to know if I can be pointed in the right direction. One of the tasks of my job is to sort through some data that we've been c...
Hi, The table consists of pairs of users which are connected together. The following is a hypothetical example: user1, user2 a, b a, c c, a c, d d, e a, e j, n g, n f, n By randomly picking up a user from the table (user1 or user2) I would like to retrieve the whole cluster of connections to which the selected user belongs. For examp...
I have been using JGraphX to display some data (simple discrete graphs) and I would like to know how to do the following things with the JGraphX library: Make all edges unmovable but still allow the user to create an edge between two vertices Make all vertices and edges uneditable (they cannot edit what is displayed on them) How do I g...
I have a BGL graph and want to create a spanning tree using BGL. Starting from a specified vertex, I want to add the shortest edge to my graph which connects with this vertex. From there on, I want to always pick the shortest edge which connects with the graph which exists thus far. So, I want to add the constraint that every new edge ...
Hi, there! I'm writting graph classes. I've wrote such code in "Graphs.h" : #include <vector> #include <iostream> using namespace std; struct Edge{ int v,w; Edge(int v=-1, int w=-1):v(v),w(w){} }; class Graph { protected: int Ecnt, Vcnt; bool digraph; public: Graph(int V, bool isDirected) :Ecnt(0),Vcnt(V),digraph(isDirected) {} ~...
Hi, I'm looking for a library which will enable me to visualize some xml entities I have, and manipulate them graphically (something similar to a UML design package, but simpler), like a cyclic flow graph. Anybody have any ideas where I should start? Preferrably I would like something managed, but if it's easier to do a HTML+JS impleme...
Hi All. I need to place 1 to 100 nodes (actually 25px dots) on a html5 canvas. I need to make them look randomly distributed so using some kind of grid is out. I also need to ensure these dots are not touching or overlapping. I would also like to not have big blank areas. Can someone tell me what this kind of algorithm is called? A re...
I have a directed graph data structure, where I am trying to implement individual version control for each vertex. This creates some interesting scenarios, and I would much appreciate any ideas that you guys have. Specifically, I am looking to resolve the default behavior of the system when encountering the stated scenarios. See the fol...
I'd like to know, how coordinates can be transformed to center of the form for drawing mathematical functions. I already tried ->TranslateTransform(x,y) on Graphics object, this works, but only in one quarter of coordinates. How should I draw math functions on the form?Programming C++ long, but WinForms and Drawing are new 4 me. ...
I have the following graph my %connections=(36=>[31,22],31=>[30],30=>[20],22=>[20,8],20=>[1],8=>[5],5=>[2],2=>[1,20]); Is there any existing algorithm that let us find node with only outgoing edges and only incoming edges. Hence given the above graph, it would yield: $node_only_incoming_edge = [36]; $node_only_outgoing_edge = [1]; ...
Is there any efficient algorithm to find the set of edges with the following properties, in a complete weighted graph with an even number of vertices. the set has the smallest, maximum edge weight for any set that meats the other criteria possible every vertex is connected to exactly one edge in the set All weights are positive dI c...
Hi Guys, I am suppose to generate graph from the results/execution of my algorithm . I have heard something about using CSV file in Excel and generating the graph. I have no idea what this CSV file is and how to do it. I googled CSV file but the answer i got was in connection with databases. I am asking if someone can show me or poin...