I have this graph: I would like to return all the pumps that is under a heat exchanger, which again is under a air handler unit, that is under a bu ...
I have this graph: I would like to return all the pumps that is under a heat exchanger, which again is under a air handler unit, that is under a bu ...
I want to circle through the array multiple times. When I reach the last index, the next index should be the first one. For example, I have an array o ...
I'm trying to understand Traversal API for Neo4j, but I have a problem with dependencies: also: Here is my code (because of the dependencies, I' ...
I used list implementation to create a graph. However, I don't get why we need to perform a breath-first with queue or depth-first with stack to rea ...
I'm not looking for a solution. All I'm looking for is guidance. I am stuck on this problem and I have no idea what to study or learn in order to solv ...
I am trying to solve the following problem: We have an undirected weighted graph in which we can repeat vertices and edges while traversing. The weig ...
I have a table made in this way: COLUMN_A COLUMN_B COLUMN_C 35108337 B0110555 ...
for this function, i need to traverse through a file and count each line based on certain signifiers. If that certain signifier is present in the line ...
I'm trying to iterate through a nested object to retrieve a specific object identified by a string. In the sample object below, the identifier string ...
I have a 2d grid with some of the tiles being obstacles (walls), I want to be able to find the shortest path that allows you to go around the grid bei ...
I have an unordered_map of 'n' elements. It has a some eligible elements. I want to write a function such that each time, a random eligible element is ...
There is an array of arrays filled with numbers and letters. I want to collect the isolated ones in array of arrays. So, for example, if I call a func ...
I have a monad m that supports the following operation: someName :: (t1 -> m u1) -> (t2 -> m u2) -> ((t1, t2) -> m (u1, u2)) In some ...
Wondering, if for given G graph, considering cost of the edges are labeled. Not specifying whether they are the same for each edge, or not. Is BFS or ...
I want to traverse my matrix in the L shape, and I took the code from this link https://www.geeksforgeeks.org/traverse-matrix-in-l-shape/. However, it ...
Hello I'm messing around with Gremlin to find paths from one node to another. I have a weighted graph and I need to be able to find all the paths that ...
Given two singly linked lists of size N and M, write a program to get the point where two linked lists intersect each other. For the given input as : ...
It is printing: "JAVA lecture is repeating 2 times" instead of "JAVA lecture is repeating 4 times", for sample input of: "JAVA JAVA DataStructures D ...
Background Info I have an object containing some data from a network log. Here is what it looks like. The network_log element will always exist. E ...
Motivation I am developing an R package with an essential helper function "make()". This make() function accepts a ragged list, then maps function fo ...