python (65.2k questions)

javascript (44.3k questions)

reactjs (22.7k questions)

java (20.8k questions)

c# (17.4k questions)

html (16.3k questions)

r (13.7k questions)

android (13k questions)

Questions - recursive-datastructures

Java Filter list object with Recursive Children

Given this obj. public class Menu { private String id; private String matchCode; private List<Menu> children; //getters and setters /** * Flattened funcition to recursive children list ...
test-img

Kevin Valdez

java

list

stream

recursive-datastructures

Votes: 0

Answers: 1

Latest Answer

I think could be simpler. private List<Menu> filterByMatchRoleCode(List<Menu> menuList) { return menuList.stream() .peek( x -> x.setChildren( filterByMatchRo...
test-img

Ravi Gupta

For loop is not working inside recursive function

1.I have a use case where i want the parent to be made false if any last child "isSelected" is true. For example the id 4 isSelcted is true so the parents of 4 are 3,2,1 whose key "coll...
test-img

Srujan R

javascript

algorithm

loops

data-structures

recursive-datastructures

Votes: 0

Answers: 1

Latest Answer

I figured out the solution thanks. function recursiveUpdate(object) { function rec(obj){ if(!obj.children){ if(obj.isSelected){return false}else{return true} }else...
test-img

Srujan R

How to find indexes of elements in recursive-knapsack?

I'm trying to implement recursive Knapsack which would return 2 things: Max value we get by filling knapsack. Indexes of the elements considered for filling the knapsack. Please note that I don't wa...
test-img

Jatin

c++

data-structures

knapsack-problem

recursive-datastructures

Votes: 0

Answers: 2

Latest Answer

The vector idx is passed by reference: vector<int>& idx. The issue is that here: int consider = val[N - 1] + knapsack(wt, val, W - wt[N - 1], N - 1, idx); int dontconsider = knapsack(wt, v...
test-img

Damien

Given a kd tree-like grid, how to find two nearest intersecting lines

Say I have a grid structure like the image here: Give point D, I want to find the nearest points whose line intersects with the line created by D. I need a way to find C and E, but not A or B. A is n...
test-img

Knoland

search

data-structures

recursive-datastructures

kdtree

Votes: 0

Answers: 1

Latest Answer

I wound up implementing this as a directional, unweighted graph. Each vertex in the graph is a line, with an X,Y coordinate, and a direction. A vertex is connected to it's parent via a directional rel...
test-img

Knoland

Posts

Questions

Blogs

Jobs