Search Results

Search found 7220 results on 289 pages for 'graph algorithm'.

Page 58/289 | < Previous Page | 54 55 56 57 58 59 60 61 62 63 64 65  | Next Page >

  • C# node graph api to use

    - by wind
    I need display a node graph in c# and find the short possible path(figure 10 of http://msdn.microsoft.com/en-us/library/aa289152(VS.71).aspx). What API can i use to draw out all the node and link? Anyone can advise?

    Read the article

  • Facebook Graph API and ActionScript

    - by dani
    I'm setting out to develop a number of Facebook applications/games, which make use of some Facebook user information and stores game info in a database backend etc, in ActionScript 3.0. How can one leverage the new Graph API Should I use JavaScript or PHP as a "middle layer" or should I go with the ActionScript Client Library? Are there other libraries (Facebook / database / multiplayer related.) that could simplify the development of these Facebook games?

    Read the article

  • Graph representation benchmarking

    - by Carlucho
    Currently am developing a program that solves (if possible) any given labyrinth of dimensions from 3X4 to 26x30. I represent the graph using both adj matrix (sparse) and adj list. I would like to know how to output the total time taken by the DFS to find the solution using one and then the other method. Programatically, how could i produce such benchmark?

    Read the article

  • Xcode: Internal error occurred while creating dependency graph

    - by Randy Simon
    I just started getting this error today, seemingly out of nowhere. Any one see this before and know what causes it. Internal error occurred while creating dependency graph: *** -[NSCFArray initWithObjects:count:]: attempt to insert nil object at objects[10] This happens when I try to build with "iPhone Device 3.x" selected. However, if I select "iPhone Simulator 3.x", everything is fine.

    Read the article

  • How does an unsharp mask work?

    - by Bob Aman
    I've been playing around with image processing lately, and I'd like to know how the unsharp mask algorithm works. I'm looking at the source code for Gimp and it's implementation, but so far I'm still in the dark about how it actually works. I need to implement it for a project I'm working on, but I'd like to actually understand the algorithm I'm using.

    Read the article

  • Graph paper like drawing software

    - by Algorist
    Hi, I have a college assignment, where I have to draw diagrams of voronoi, delaunay, minimum spanning tree etc for the college. I want to do that in computer. I searched in google with no luck. Is there any good graph drawing software you are aware of? Thank you Bala

    Read the article

  • Highcharts Area graph, use 2 fill colors above / below X axis

    - by Kris Chant
    In Highcharts, I'd like to fill an Area graph with 2 colors, positive values get one color, negative values get another color. I've been able to do this with a linearGradient, but this must be adjusted based upon the size of the container. Is there a more general way of doing this, e.g. setting values 0 color 1, values < 0 color 2? See my JSFiddle for more information and an example: http://jsfiddle.net/GNvur/2/

    Read the article

  • List all possible combinations of k integers between 1...n (n choose k)

    - by Asaf R
    Hi, Out of no particular reason I decided to look for an algorithm that produces all possible choices of k integers between 1...n, where the order amongst the k integer doesn't matter (the n choose k thingy). From the exact same reason, which is no reason at all, I also implemented it in C#. My question is: Do you see any mistake in my algorithm or code? And, more importantly, can you suggest a better algorithm? Please pay more attention to the algorithm than the code itself. It's not the prettiest code I've ever written, although do tell if you see an error. EDIT: Alogirthm explained - We hold k indices. This creates k nested for loops, where loop i's index is indices[i]. It simulates k for loops where indices[i+1] belongs to a loop nested within the loop of indices[i]. indices[i] runs from indices[i - 1] + 1 to n - k + i + 1. CODE: public class AllPossibleCombination { int n, k; int[] indices; List<int[]> combinations = null; public AllPossibleCombination(int n_, int k_) { if (n_ <= 0) { throw new ArgumentException("n_ must be in N+"); } if (k_ <= 0) { throw new ArgumentException("k_ must be in N+"); } if (k_ > n_) { throw new ArgumentException("k_ can be at most n_"); } n = n_; k = k_; indices = new int[k]; indices[0] = 1; } /// <summary> /// Returns all possible k combination of 0..n-1 /// </summary> /// <returns></returns> public List<int[]> GetCombinations() { if (combinations == null) { combinations = new List<int[]>(); Iterate(0); } return combinations; } private void Iterate(int ii) { // // Initialize // if (ii > 0) { indices[ii] = indices[ii - 1] + 1; } for (; indices[ii] <= (n - k + ii + 1); indices[ii]++) { if (ii < k - 1) { Iterate(ii + 1); } else { int[] combination = new int[k]; indices.CopyTo(combination, 0); combinations.Add(combination); } } } } I apologize for the long question, it might be fit for a blog post, but I do want the community's opinion here. Thanks, Asaf

    Read the article

  • FaceBook Graph API

    - by LingAi
    Hi All, When I use FaceBook API for retrieving posts information, I found that the returned information are changing all the time. for e.g., when I retrieved information 2 times with 1mins interval, one record appears in the 1st time, and disapeared in the 2nd time. https://graph.facebook.com/search?q=baby&type=post&limit=100&since=2010-05-19&until=2010-05-21 Does anyone know what happen? Cheers, LingChen

    Read the article

  • Speed boost to adjacency matrix

    - by samoz
    I currently have an algorithm that operates on an adjacency matrix of size n by m. In my algorithm, I need to zero out entire rows or columns at a time. My implementation is currently O(m) or O(n) depending on if it's a column or row. Is there any way to zero out a column or row in O(1) time?

    Read the article

  • Gtk Based Graph

    - by paultop6
    Hi Guys, Bit of a general question here, i want to be able to make a line graph using GTK but im unsure how to approach this... Has anyone got any hints or tips? Regards Paul

    Read the article

  • Algorithm to compare people names to detect identicalness

    - by Pentium10
    I am working on address book synchronization algorithm. I would like to reuse some code if there exists, but couldn't find one yet. Does someone know about an algorithm that will tell me in numbers/float/procent how much two names are identical. Levenstein distance is not good in this approach, as names and our adddress books are matching the begining of each of the name sections. John Smith should match Smith Jon, Jonathan Smith, Johnny Smith

    Read the article

  • Sliding window algorithm for activiting recognition MATLAB

    - by csc
    I want to write a sliding window algorithm for use in activity recognition. The training data is <1xN so I'm thinking I just need to take (say window_size=3) the window_size of data and train that. I also later want to use this algorithm on a matrix . I'm new to matlab so i need any advice/directions on how to implement this correctly.

    Read the article

  • Higher-order unification

    - by rwallace
    I'm working on a higher-order theorem prover, of which unification seems to be the most difficult subproblem. If Huet's algorithm is still considered state-of-the-art, does anyone have any links to explanations of it that are written to be understood by a programmer rather than a mathematician? Or even any examples of where it works and the usual first-order algorithm doesn't?

    Read the article

  • Is Collections.shuffle suitable for a poker algorithm?

    - by Kovu
    Hi, there is a poker-system in java, that uses Collections.shuffle() on all available cards before the cards are dealt. So a collection of 52 cards 2-9, J, Q, K, A in 4 types. After that we Collections.shuffle(). The problem is, that it seems (until now we didn't have big statistic, it's possible that we only see a lot of statistic inferences), that the algorithm is VERY unclearly. So, is Collections.shuffle() okay for a poker algorithm?

    Read the article

  • Facebook graph api resources!

    - by kielie
    Hi guys, I am creating a little flash game for the facebook platform, but I am finding it very difficult to get any decent documentation on the graph api, so if anyone has a decent resource for a beginner to go and learn the basics, I would appreciate it very much, as I am struggling to grasp the concept. Thanx!

    Read the article

  • Facebook graph api for PHP resources!

    - by kielie
    Hi guys, I am creating a little flash game for the facebook platform, but I am finding it very difficult to get any decent documentation on the graph api and the PHP SDK, so if anyone has a decent resource for a beginner to go and learn the basics, I would appreciate it very much, as I am struggling to grasp the concept. Thanx!

    Read the article

  • String searching algorithm for Chinese characters.

    - by Jack Low
    There are Python code available for existing algorithms for normal string searching e.g. Boyer-Moore Algorithm. I am looking to use this on Chinese characters and it doesn't seem like the same implementation would work. What would I go about doing in order to make the algorithm work on Chinese characters? I am referring to this: http://en.literateprograms.org/Boyer-Moore_string_search_algorithm_(Python)#References

    Read the article

  • What container is eaziest for combining Jpegs and MP3s as video?

    - by Ole Jak
    So I have N (for example 1000) Jpeg frames and 10*N ( for ex 100) seconds of MP3 sound I need some conteiner for Joining them into one Video file (10 frames/second) (beter popular like FLV or AVI or MOV). So what I need is algorithm or code example of combining my data into some popular format. (code example beter be in some language like C# Java or ActionScript or PHP, Algorithm should be theoreticly Implementable with ActionScript or PHP) Can any one, please help me with that?)

    Read the article

< Previous Page | 54 55 56 57 58 59 60 61 62 63 64 65  | Next Page >