python (65.1k questions)

javascript (44.2k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (12.9k questions)

Questions - iterative-deepening

Optimizing iterative deepening depth first search in C++

I am using an implementation of the IDDFS graph algorithm in a project and I noticed that for each node, the function takes around 8 - 10 seconds to compute. And, with a very large dataset with over 7...
test-img

imtryin123

c++

optimization

compiler-optimization

iterative-deepening

Votes: 0

Answers: 1

Latest Answer

Here are few points to optimize your code: The parameter vector<int> path is copied for no apparent reasons. You can pass it by reference. vector<int> new_path = path; create a new copy o...
test-img

J&#233;r&#244;me Richard

Using Iterative deepening DFS for knapsack similar problem

I'm solving a knapsack similar problem: which is to print out the first combination of objects that has value above a number but weight below a limit. I have tried: value = [10, 8, 7, 6, 4] weight = [...
test-img

Jason

depth-first-search

knapsack-problem

iterative-deepening

Votes: 0

Answers: 1

Latest Answer

I tried this and it works for some samples: weight = [1,1,3,4,5] value = [2,1,5,3,5] name = ['A','B','C','D','E'] knapsack = [] limit_weight = 8 limit_value = 8 n = 5 # number of items def ID(maxDept...
test-img

subspring

Posts

Questions

Blogs

Jobs