Search Results

Search found 5655 results on 227 pages for 'stl algorithm'.

Page 29/227 | < Previous Page | 25 26 27 28 29 30 31 32 33 34 35 36  | Next Page >

• 2D Grid Map Connectivity Check (avoiding stack overflow)

  - by SombreErmine

  I am trying to create a routine in C++ that will run before a more expensive A* algorithm that checks to see if two nodes on a 2D grid map are connected or not. What I need to know is a good way to accomplish this sequentially rather than recursively to avoid overflowing the stack. What I've Done Already I've implemented this with ease using a…

  Read the article

• Algorithm to Solve Most of a Problem

  - by Mike G

  I need an Algorithm/Design Pattern that allows me to try to get the maximum number of rules followed. So I have a couple teams and I need to pair them with a referee and against each other into a round robin. There a rules on who can compete with who and who can judge who so I need to find the configuration that satisfies the most of these. Some…

  Read the article

• Compare two files with Hash Algorithm

  This article shows you how to compare two files using Hash Algorithm.

  Read the article

• Text comparison algorithm using java-diff-utils

  - by java_mouse

  One of the features in our project is to implement a comparison algorithm between two versions of text and provide a % change between the two versions. While I was researching, I came across google java-diff-utils project. Has anyone used this for comparing text using java-diff-utils ? Using this utility, I can get a list of "delta" which I…

  Read the article

• How to implement an intelligent enemy in a shoot-em-up?

  - by bummzack

  Imagine a very simple shoot-em-up, something we all know: You're the player (green). Your movement is restricted to the X axis. Our enemy (or enemies) is at the top of the screen, his movement is also restricted to the X axis. The player fires bullets (yellow) at the enemy. I'd like to implement an A.I. for the enemy that should be really…

  Read the article

• Algorithm to calculate trajectories from vector field

  - by cheeesus

  I have a two-dimensional vector field, i.e., for each point (x, y) I have a vector (u, v), whereas u and v are functions of x and y. This vector field canonically defines a set of trajectories, i.e. a set of paths a particle would take if it follows along the vector field. In the following image, the vector field is depicted in red, and…

  Read the article

• One dimensional cutting algorithm with minimum waste

  - by jm666

  Can anybody point me to some resources about "cutting algorithm"? The problem: have rods with length of L meters, e.g. 6 m need cut smaller pieces of different lengths, e.g. need: 4 x 1.2m 8 x 0,9m etc... (many other lengths and counts) How to determine the optimal cutting, what will produce the minimum wasted material? I'm…

  Read the article

• Create a fast algorithm for a "weighted" median

  - by Hameer Abbasi

  Suppose we have a set S with k elements of 2-dimensional vectors, (x, n). What would be the most efficient algorithm to calculate the median of the weighted set? By "weighted set", I mean that the number x has a weight n. Here is an example (inefficient due to sorting) algorithm, where Sx is the x-part, and Sn is the n-part.…

  Read the article

• How do I optimize searching for the nearest point?

  - by Rootosaurus

  For a little project of mine I'm trying to implement a space colonization algorithm in order to grow trees. The current implementation of this algorithm works fine. But I have to optimize the whole thing in order to make it generate faster. I work with 1 to 300K of random attraction points to generate one tree, and it takes…

  Read the article

• Low CPU/Memory/Memory-bandwith Pathfinding (maybe like in Warcraft 1)

  - by Valmond

  Dijkstra and A* are all nice and popular but what kind of algorithm was used in Warcraft 1 for pathfinding? I remember that the enemy could get trapped in bowl-like caverns which means there were (most probably) no full-path calculations from "start to end". If I recall correctly, the algorithm could be something like this:…

  Read the article

• Automated tests for differencing algorithm

  - by Matthew Rodatus

  We are designing a differencing algorithm (based on Longest Common Subsequence) that compares a source text and a modified copy to extract the new content (i.e. content that is only in the modified copy). I'm currently compiling a library of test case data. We need to be able to run automated tests that verify the test…

  Read the article

• Algorithm to simplify building/structural meshes

  - by morpheus

  I am looking for an algorithm to simplify the meshes of buildings or similar structures. EDIT: I had made a comment that Hoppe's algorithm tends to make meshes more and more spherical with simplification. But, I am not sure about it, so am deleting the comment. Buildings in contrast should tend to become more and more…

  Read the article

• booth multiplication algorithm

  - by grassPro

  Is booth algorithm for multiplication only for multiplying 2 negative numbers (-3 * -4) or one positive and one negative number (-3 * 4) ? Whenever i multiply 2 positive numbers using booth algorithm i get a wrong result. example : 5 * 4 A = 101 000 0 // binary of 5 is 101 S = 011 000 0 // 2's complement of 5 is…

  Read the article

• Algorithm for optimal combination of two variables

  - by AlanChavez

  I'm looking for an algorithm that would be able to determine the optimal combination of two variables, but I'm not sure where to start looking. For example, if I have 10,000 rows in a database and each row contains price, and square feet is there any algorithm out there that will be able to determine what combination…

  Read the article

• A look at an example of anti-spam algorithm

  - by pragmaticCamel

  What is a good approach to an anti-spam algorithm for a website similar to reddit? Their anti-spam algorithm seems awfully broken (banning on words in the title and doing a horrible job for that matter). Considering a post spam because it has the word 'spam' in the title is really not a wise choice. Anyway, how can…

  Read the article

• Application of LGPL license on a simple algorithm

  - by georgesl

  The "scope" of the GNU license is troubling me : I know it has been answered many times ( here, here, ... ) but shouldn't we take into consideration the complexity and originality of a code before using GPL license ? I explain : I'm working on a pet project using the DTW algorithm that I have written in C using the…

  Read the article

• OmniCppComplete: Completing on Class Members which are STL containers

  - by Robert S. Barnes

  Completion on class members which are STL containers is failing. Completion on local objects which are STL containers works fine. For example, given the following files: // foo.h #include <string> class foo { public: void set_str(const std::string &); std::string get_str_reverse( void…

  Read the article

• Any great books of algorithm puzzles to practice whiteboard coding with?

  - by jboxer

  I'm looking to get some practice coding solutions to algorithm puzzles on a whiteboard. A friend is going to read puzzles to me (as if he were interviewing me), and I'll solve them on a whiteboard. Does anyone know any great books with algorithm puzzles that would be useful for this? I found a book called Puzzles…

  Read the article

• whats the genetic algorithm code for shortest path between nodes?

  - by jordan11

  whats the genetic algorithm code for shortest path between nodes?

  Read the article

• Making change recursively: How do I modify my algorithm to print all combinations?

  - by cb

  I have an algorithm that recursively makes change in the following manner: public static int makeChange(int amount, int currentCoin) { //if amount = zero, we are at the bottom of a successful recursion if (amount == 0){ //return 1 to add this successful solution return 1;…

  Read the article

• Most efficient algorithm for mesh-level, optimal occlusion culling?

  - by Fredriku73

  I am new to culling. On a first glance, it seems that most occlusion culling algorithms are object-level, not examining single meshes, which would be practical for game rendering. What I am looking for is an algorithm that culls all meshes within a single object that are occluded for a given viewpoint, with high…

  Read the article

• Looking for an algorithm in vb.net or c# but I don't know it's name!

  - by Jules

  I'll do my best to explain what the algorithm is supposed to do: There's a class 'Recipe'. Each Recipe can include other Recipes but cannot include itself or any other Recipe that includes it. So, a simple example is we have just two Recipes A & B. If A adds B first, then later on B cannot add A because…

  Read the article

• Is there an existing algorithm for this notation translation/conversion?

  - by John

  A system has a notation that would require writing an expression like (A+B)*C as #MUL(#ADD(A,B),C). Is there already an algorithm to do this kind of notation conversion so users can enter in a more conventional way? In other words an algorithm to convert from infix - my notation. First issue is I don't know an…

  Read the article

• Algorithm: Determine shape of two sectors delineated by an arbitrary path, and then fill one.

  - by Arseniy Banayev

  NOTE: This is a challenging problem for anybody who likes logic problems, etc. Consider a rectangular two-dimensional grid of height H and width W. Every space on the grid has a value, either 0 1 or 2. Initially, every space on the grid is a 0, except for the spaces along each of the four edges, which are…

  Read the article

• Algorithm Question.. Linked List..

  - by AGeek

  Hi, Scenario is as follows:- I want to reverse the direction of the singly linked list, In other words, after the reversal all pointers should now point backwards.. Well the algorithm should take linear time. The solution that i have thought of using another datastructure A Stack.. With the help of…

  Read the article

< Previous Page | 25 26 27 28 29 30 31 32 33 34 35 36  | Next Page >