I was wondering how to use C++11 smart pointers correctly for graph representations. Suppose, you have a graph structure which contains a vector of all its vertices. Furthermore, you have a struct...

I am trying to generate a hierarchical tree object from a flat array with parent IDs. // `parent` represents an ID and not the nesting level. var flat = [ { id: 1, name: "Business", parent: 0 }, ...

I have a two-table hierarchical setup where table A references table B, which then references back to a different record in table A, and so on... but only up to a given recursion depth. I have thi...

I am trying to implement a graph in C++. I am representing a node in graph using a structure which contains two variables - a) an integer to contain some information about the node. b) a list to co...

In C#, I have class Pair{ int val1; int val2; } I have a list of pairs coming from a source as:- List<Pair> sList = new List<Pair>(); 1 | 2 2 | 3 1 | 4 4 | 6 I need to con...

Given the following model: create table child_parent ( child number(3), parent number(3) ); Given the following data: insert into child_parent values(2,1); insert into child_parent values(3,1...

Is there any effective way to, without limiting the depth, retrieve a single path in a Adjacency List model based on the node's ID? Like if I've got an ID for a node named "Banana" I could get the ...

I have a DB like so: id text parent 1 Parent 1 0 2 Child of 1 1 3 Sibling 1 4 Another Parent 0 5 A first child 4 So I'm trying to capture a tree structure my listing the parents. I'm aware o...

I have a Table that stores Hierarchical information using the Adjacency List model. (uses a self referential key - example below. This Table may look familiar): category_id name parent -----------...

I was playing around (out of interest) with retrieving a tree of nodes in a simple adjacency list with a recursive query using local variables. The solution i have so far is fun but i wonder (and...

For a while now I've been wrestling with how best to handle hierarchies in SQL. Frustrated by the limitations of adjacency lists and the complexity of MPTT/nested sets, I began thinking about simpl...

I'm preparing for a coding interview, and was refreshing my mind on graphs. I was wondering the following : in all places I've seen, it is assumed that adjacency lists are more memory efficient tha...

I'll admit this is my homework. The task statement said I have to write a program that finds a topological order of a graph which would be inputted by standard input. Then I need to submit it to be...

I have a table which contains a location of all geographical locations in the world and their relationships. Here is a example that shows the hierarchy. You will see that the data is actually store...

I've spent the last few hours trying to find the solution to this question online. I've found plenty of examples on how to convert from nested set to adjacency... but few that go the other way arou...

I want to create this Markov Chain in C#. I need to know if there is any other structure other than adjacency list which can work better in this situation. Also how can I use the existing .Net coll...

Currently am developing a program that solves (if possible) any given labyrinth of dimensions from 3X4 to 26x30. I represent the graph using both adj matrix (sparse) and adj list. I would like to k...

I have an adjacency list of objects (rows loaded from SQL database with the key and it's parent key) that I need to use to build an unordered tree. It's guaranteed to not have cycles. This is taki...

I am using adjacency lists to represent a directed weighted graph and based on the example code provided by this SO question, I have created the following: import java.util.HashMap; import java.ut...