Search Results

Search found 3416 results on 137 pages for 'scene graph'.

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

Page 10/137 | < Previous Page | 6 7 8 9 10 11 12 13 14 15 16 17  | Next Page >

  • Open Graph API - Github PHP Class

    - by clarkstudios
    Hi all, I have downloaded the PHP class from github which is the wrapper for their Open Graph API. I can log in and list freinds and images etc. But what I am really struggling with is allowing for extended permissions to allow posting to a users wall. I know somewhere I need to add "scope=publish_stream" to allow this option and can only assume it is on the getLoginUrl method but I am having next to know joy with it. Can anyone help me. Steve

    Read the article

  • Weakly connected balanced digraph

    - by user1074557
    How can I prove that if a balanced digraph is weakly connected, then it is also strongly connected? (balanced digraph means that for every node, it's indegree and outdegree is the same and weakly connected means the non-directed version of this graph is connected). What I can think of so far is: if the graph is balanced, it means it is a union of directed cycles. So if I remove any cycle, it will stay balanced. Also each vertex in the cycle has one edge coming into it and one edge leading out of it.. Then I guess I need to use some contradiction or induction to prove that the graph is strongly connected.. That's where I confused.

    Read the article

  • Translation of clustering problem to graph theory language

    - by honk
    I have a rectangular planar grid, with each cell assigned some integer weight. I am looking for an algorithm to identify clusters of 3 to 6 adjacent cells with higher-than-average weight. These blobs should have approximately circular shape. For my case the average weight of the cells not containing a cluster is around 6, and that for cells containing a cluster is around 6+4, i.e. there is a "background weight" somewhere around 6. The weights fluctuate with a Poisson statistic. For small background greedy or seeded algorithms perform pretty well, but this breaks down if my cluster cells have weights close to fluctuations in the background. Also, I cannot do a brute-force search looping through all possible setups because my grid is large (something like 1000x1000). I have the impression there might exist ways to tackle this in graph theory. I heard of vertex-covers and cliques, but am not sure how to best translate my problem into their language.

    Read the article

  • Publish limit on Facebook's Graph API

    - by Andy
    Hey guys, I've been using the Graph API for a while. One feature of my application is that it allows a user to post a message on their friends walls (dont worry it is not spam). Anyway...there is a limit on the API and it will only allow a certain number of posts before failing. I've read on the facebook bucket allocation limits but my app's limit has not moved. It was 26 when i created the app. It is still 26 even though there are about 20 users. What can I do to increase my pulish limit? And I promise this app is not used for anything spam related.

    Read the article

  • (interactive) graph as in graph theory on a web page ?

    - by LB
    Hi, I have to integrate a graph with nodes and edges on a web page. Ideally, i would like to be able to interact with it (like moving the nodes around). Actually, i'm beginning by representing trees, so i would appreciate to be able to collapse subtrees. How can I do that ? I was considering google-visualization api but i wasn't able to find the kind of visualization i'm looking for (org chart doesn't allow to have multiple fathers, if i understood well) I've got no idea of the kind of technology so my tagging may not be really accurate :-). thanks

    Read the article

  • Graph databases and Php

    - by stagas
    I want to use a graph database using php. Can you point out some resources on where to get started? Is there any example code / tutorial out there? Or are there any other methods of storing data that relate to each other in totally random/abstract situations? Very abstract example of the relations needed: John relates to Mary, both relate to School, John is Tall, Mary is Short, John has Blue Eyes, Mary has Green Eyes, query I want is which people are related to 'Short people that have Green Eyes and go to School' - answer John It is possible in MySQL but it would require a fixed set of attributes/columns for each item and a complex non-flexible query, instead I need every attribute to be an item by itself and instead of 'belonging' to something, to be 'related' to something.

    Read the article

  • Graph API - Get events by owner/creator

    - by jwynveen
    Is there a way with the Facebook Graph API to get a list of all events created by a single profile? Our client creates a bunch of events and we want to pull a list of them all. I said that they would just have to make sure they set themselves to be attending the event, because then I can easily pull the list of events that profileId is attending, but I'm curious if there's another way. Maybe an FQL query? They look to require a query on the primary key though. And what would that FQL query look like if that's the way to do it??

    Read the article

  • Graph Algorithm To Find All Paths Between N Arbitrary Vertices

    - by russtbarnacle
    I have an graph with the following attributes: Undirected Not weighted Each vertex has a minimum of 2 and maximum of 6 edges connected to it. Vertex count will be < 100 I'm looking for paths between a random subset of the vertices (at least 2). The paths should simple paths that only go through any vertex once. My end goal is to have a set of routes so that you can start at one of the subset vertices and reach any of the other subset vertices. Its not necessary to pass through all the subset nodes when following a route. All of the algorithms I've found (Dijkstra,Depth first search etc.) seem to be dealing with paths between two vertices and shortest paths. Is there a known algorithm that will give me all the paths (I suppose these are subgraphs) that connect these subset of vertices?

    Read the article

  • Using Facebook Graph to simply post a wall message with just javascript

    - by Glycerine
    Hey guys, Now I know this question has been asked similarly a lot of times but I'm really struggling here. Its a simple thing I need to do: I would like to post a message onto a users wall saying "I scored 8/10 on objects game" then a URL Thats it. I don't mind if facebook needs to authenticate and then post the message. and I really don't want to have to use the full API - as I don't want to handle user login details. Is it possible using the new Graph API and javascript. Uber thanks guys this'll allow me to sleep tonight.

    Read the article

  • Facebook Graph and PHP API

    - by Wes
    I've been working at this for a few hours, but the poor documentation is of no help. All I want to do is grab the data that exists at https://graph.facebook.com/cocacola/ as an example, and I cant even do that. I'm using the latest php API from facebook. This is my code, which returns nothing: <?php require '../src/facebook.php'; // Create our Application instance. $facebook = new Facebook(array( 'appId' => '254752073152', 'secret' => '904270b68a2cc3d54485323652da4d14', 'cookie' => true, )); $coke = $facebook->api('/cocacola'); echo '<pre>'; print_r($coke); echo '</pre>'; Any idea?

    Read the article

  • Using the Facebook Graph APIs PHP library

    - by briggins5
    I am using the PHP library for the Graph API (http://github.com/facebook/php-sdk) but am a bit confused about how it is all working (or not). I just want to authenticate the user and get the user ID back. What I really want to know is what to do once the user has logged in to Facebook and returned to my site. There is data called 'session' in the URL. Does this need to be stored in order to continually get the user ID? It is really not apparent, to me, from the samples or (lack of) documentation. Also, would it be easier to just cut out the PHP library altogether and just handle the reponse myself, storing it in a session variable. If i were to do this, what is the best method of getting/extracting the current users ID?

    Read the article

  • Privacy setting using Graph API

    - by Anthony
    Hello, I'm currently trying to se privacy setting on post I do through Graph API, code is: function graphStreamPublish(){ message1 = document.getElementById('message').value; FB.api('/me/feed', 'post', { message: message1 }, privacy: {value: "CUSTOM", friends: "SOME_FRIENDS", network: "1", allow: "204506204", deny: "515592311", function(response) { if (response && response.post_id) { alert('Post was not published.'); } else { alert('Post was published.'); } }); } Then I just call this function for the things I right on textarea: <center><textarea id="message" cols="50" rows="5">Test goes here!</textarea></center> <br /> <center><a href="" onclick="graphStreamPublish(); return false;">Post message now!</a></center> This does not work however woth the privacy part but works fine without. Am i doing something wrong? Thanks.

    Read the article

  • Facebook Graph problem

    - by attar
    I'm trying to get basic informations from an facebook page with this code: <?php $fb = file_get_contents("https://graph.facebook.com/exemplename", "rb"); $fb_array=json_decode($fb,true); echo $fb_array['id']; echo $fb_array['name']; echo $fb_array['picture']; ?> This work perfect on xampp local server but when i upload on webserver it just show a blank page. Anyone knows the reason why it doesn't work on webserver ?

    Read the article

  • Graph - strongly connected components

    - by HardCoder1986
    Hello! Is there any fast way to determine the size of the largest strongly connected component in a graph? I mean, like, the obvious approach would mean determining every SCC (could be done using two DFS calls, I suppose) and then looping through them and taking the maximum. I'm pretty sure there has to be some better approach if I only need to have the size of that component and only the largest one, but I can't think of a good solution. Any ideas? Thanks.

    Read the article

  • Graph call "/me/friends" doesn't contain names if called from a testuser

    - by Marc
    When I log into Facebook with my account and call the Graph API with /me/friends it returns an array like this: [ {id: "6868...", name: "John Smith"}, {id: "7531...", name: "Diane Smith"}, ... ] But if I'm logged in with a Facebook testuser and do the same call I get an array like this: [ {id: "100002927..."}, {id: "100003151..."}, ... ] So I'm missing the name property. Bug? Or did I some mistake? I'm using the JS SDK, but I think that doesn't matter.

    Read the article

  • Facebook graph api - delete like

    - by Martin
    Hi there, I'm developing an app for Facebook in PHP, part of which lists the user's "likes". I would like to add a link next to each like so that the user can manage their likes by deleting them where they see fit. Facebook mentions this in their graph api docs: "You can delete a like by issuing a DELETE request to /POST_ID/likes (since likes don't have an ID)." But each like must have an id - how else would you delete it? Has anyone done this before, any help will be appreciated.

    Read the article

  • Facebook Graph API shows different results in me/home

    - by elekatonio
    Hi, When I do a GET with my browser (already logged-in at Facebook): https://graph.facebook.com/me/home?access_token={token} the results are different than doing the same via a FB app using Facebook C# SDK. Specifically, what the API is not returning are feeds posted by other applications. Why can be this happening? Can't an application retrieve updates from other applications even if it has the read_stream permission? I even requested for additional permissions: read_stream,user_activities,friends_activities,friends_likes,user_likes,read_requests but nothing has changed. What I need is to get ALL and the same stories an user would see at his FB news feed.

    Read the article

  • Facebook Open Graph without a browser

    - by Hellnar
    Hello, For a middleware system with internet (which works inside a set-top box) I want to develop a primitive Facebook interface where users can type their user-names and password, showing their latest notification, messages and other casual stuff on the TV screen by using the recent Facebook Graph API. This middleware program uses Java ME to run programs (such as this simple facebook app) and it can connect to internet however it doesn't have a real web browser. Without browser it can connect to any url to retrieve the JSON response however I am not sure how to achieve authentication without a real browser. Under this circumstances, is it possible Facebook authentication? If you think so, what approach would you suggest ? Thanks

    Read the article

  • Facebook Graph API - Get like count on page/group photos

    - by JackLeo
    I've been testing graph API and ran into a problem. How can I get like count from photos of a page/group? I'm administrator/creator of a group. When entering in https://developers.facebook.com/tools/explorer/ certain photo ID from that group it brings almost all data, even comments, but not the like count. For like part it needs (according to docs) access token despite the fact that anyone can access that info. How to get access token of my page/group with required permissions and how to use it to get info I need? If possible I would like to get JSON from a single address if it is possible.

    Read the article

  • postID collection? through Graph API

    - by Raul Sanchez
    I've spent last days trying to get a list of recent comments in my site with no success What I want to retrieve is just the same content as I can get at https://developers.facebook.com/tools/comments/?id={APP_ID}&view=recent_comments For example... https://graph.facebook.com/{APP_ID}/comments Always returns... { "data": [ ] } I've read this query should be made to a post_id, not app_id, but then... How can I get a collection of postIDs made in my site?? Can you someone give me a tip? Thanks!

    Read the article

  • Facebook Open Graph Debugger Error

    - by Darshanjit Badrain
    Hi I am new to programming and have tried to make a facebook app with open graph beta tutorial. I have done exactly as described in the tutorial but when i try to use the debug tool it gives me an error: Extraneous Property: Objects of this type do not allow properties named og:app_id. I have noticed and searched that its doing this because the tag needs to be <fb:app_id>. I checked my file it says fb:app_id only, but the raw data that pulls up on the debug tool shows meta property="og:app_id" content="267029796703617" even though i have changed and uploaded with fb:app_id. I have checked my page several times and tried some possible solutions but have had no success. Can someone help me fix this.

    Read the article

  • How to calculate the state of a graph?

    - by zcb
    Given a graph G=(V,E), each node i is associated with 'Ci' number of objects. At each step, for every node i, the Ci objects will be taken away by the neighbors of i equally. After K steps, output the number of objects of the top five nodes which has the most objects. Some Constrains: |V|<10^5, |E|<2*10^5, K<10^7, Ci<1000 My current idea is: represent the transformation in each step with a matrix. This problem is converted to the calculation of the power of matrix. But this solution is much too slow considering |V| can be 10^5. Is there any faster way to do it?

    Read the article

facebook twitter digg google delicious technorati stumbleupon myspace wordpress linkedin gmail igoogle windows live tumblr viadeo yahoo buzz yahoo mail yahoo bookmarks favorites email print

< Previous Page | 6 7 8 9 10 11 12 13 14 15 16 17  | Next Page >