# #coding

Related news
• Published: 31/05/2020
I have a little knowledge of the Genetic Algorithm. How do I produce a scheduler that is able to generate a schedule for a set of 118 presentations where each presentation consists of a speaker and 3 ... Read more
• Published: 31/05/2020
I was trying to implement Karger's min cut algorithm in the same way it is explained here but I don't like the fact that at each step of the while loop we can pick an edge with it's two endpoints alre ... Read more
• Published: 31/05/2020
Recently i came across a problem, given 2 integers A and B, we need to convert A to B in minimum number of steps. We can perform following operations on A: If A is odd, decrease by 1 If A is even, inc ... Read more
• Published: 31/05/2020
I'm having some issues designing this algorithm. It is the classic knapsack problem with a twist, in this case, a calorie intake. You are in a restaurant where you know the calorie value of every item ... Read more
• Published: 31/05/2020
The image of the graph I need to find the Shortes Path So basiclaly the title says it all, I need to find the shortest path, and creating a Hamilton Path. So which Algorithm should I use. I have tried ... Read more
• Published: 31/05/2020
I’m writing some curve editor and an issue arose. There are two curves and I need to get their "sum", like the dotted line in the picture. In addition, when the values of two original curves are known ... Read more
• Published: 31/05/2020
I have the following example data, and I'd like to filter a piece of data, when (col1 = 'A' and col2 = '0') we want to keep rows until next (col1 = 'A') . I want to do using pandas dataframe but I don ... Read more
• Published: 31/05/2020
I was solving problems on the the ProjectEuler , And I am stuck on the 12th problem , the following code takes too longer not even done in five minutes and my CPU got warm. Essentially what I am doing ... Read more
• Published: 31/05/2020
I'm generating caves for a game. The caves are 50x50 matrix builded by cellular automata, where 0(purple) is wall and 1(yellow) is empty space (where the player can move). Here is an example of my out ... Read more
• Published: 31/05/2020
I'm searching for an algorithm to find a path between two nodes with minimum cost and maximum length given a maximum cost in an undirected weighted complete graph. Weights are non negative. As I stand ... Read more
• Published: 31/05/2020
You are given four arrays A, B, C, D each of size N. Find maximum value (M) of given below expression M = max(|A[i] - A[j]| + |B[i] - B[j]| + |C[i] - C[j]| + |D[i] - D[j]| + |i -j|) Where 1 <= i &l ... Read more
• Published: 31/05/2020
Recently I came around a programming challenge. though I am not that much of an expert in this area I tried to solve the problem. Although my code was giving the desired output at the first time but i ... Read more
• Published: 31/05/2020
How can I find a least common ancestors of multiple nodes in a directed acyclic graph? I've found quite a few papers on the topic but they all seem to find LCAs in DAG for two nodes. Are there good al ... Read more
• Published: 31/05/2020
Good evening everyone, i have the following problem. I want to create an algorithm in Javascript that solves the following problem. At the moment I lack the solution. There are 100 people and 100 boxe ... Read more
• Published: 31/05/2020
I am currently working on a school project and one of my tasks is to implement a 16-bit by 16-bit 2's complement integer divider as a digital logic circuit (in other words 16-bit input divided by anot ... Read more
• Published: 31/05/2020
I am trying to use JUNG's EdmondsKarpMaxFlow object to find the max flow between all node pairs in a directed graph. I created a simple directed graph and ran it on each combination of nodes with no e ... Read more
• Published: 31/05/2020
Here is the algorithm that I pulled from this competitive programming resource . int n; // number of vertices vector<vector<int>> adj; // adjacency list of graph vector<bool> visited ... Read more
• Published: 31/05/2020
Suppose we are given n sets and want to construct all minimal sets that have at least one element in common with each of the input sets. A set S is called minimal, if there is no admissible set S' tha ... Read more
• Published: 31/05/2020
Using an exact cover matrix of sudoku such as the one here , each row in the matrix correlates to a position in the sudoku grid (row, column) and a value. Given only the row number in the cover matrix ... Read more
• Published: 31/05/2020
Like detecting bifurcations of a root, I am really searching hard for a method as easy as possible.I hope someone can provide a useful and practical direction.I found a paper which seems so hard and c ... Read more
• Published: 31/05/2020
the following function is supposed to be replacing instances of 't' with 'a' in a given string input. Not sure why it's not working - suggestions? Cheers const replaceLetter = (str) => { let newStr ... Read more
Related Hashtags