adjacency-list

I am trying to represent a Graph in Adjacency List using C#, like the code bellow. But I would like to know where I can find a better implementation in C#. Like this website for Java: http://algs4.cs.princeton.edu/41undirected/Graph.java.html In order to improve this implementation I have some question: Is there another simple data structure to use, and that you able to make operations like DFS , BFS , Find the Shortest-path easier ? Or the data structure vary too much according to the problem to be solved ? === EDITED === I've tried to implement the data structure as bellow. OBS : This

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); insert into child_parent values(4,2); insert into child_parent values(5,2); insert into child_parent values(6,3); results in the following tree: 1 / \ 2 3 / \ \ 4 5 6 Now i can find the parents of 5 like this: SELECT parent FROM child_parent START WITH child = 5 CONNECT BY NOCYCLE PRIOR parent = child; But how can I get all the nodes (1,2,3,4,5,6) starting from 5? APC Oracle's CONNECT BY syntax is

Here is an SO post of an adjacency list. However I see no difference from a single-linked list? Also here is a wikipedia article which says that it is all the edges (of a graph, discrete math type) in a list which is pretty broad, if I have a graph, which is not a path graph. How do I code an adjacency list? Kerrek SB A simple example: Suppose you have a vertex type Vertex . They your graph consists of a set of vertices, which you can implement as: std::unordered_set<Vertex> vertices; Now for every pair of vertices between which there is an edge in your graph, you need to record that edge. In

I have an array (data from adjacency table) and it looks like: Array ( [0] => Array ( [id] => 1 [name] => Anniversary [parent] => 0 ) [1] => Array ( [id] => 12 [name] => New arrives [parent] => 1 ) [2] => Array ( [id] => 13 [name] => Discount [parent] => 12 ) [3] => Array ( [id] => 6 [name] => Birthday [parent] => 0 ) ) And I'm looking for the way to retrieve my path by ID; For example: getPath(13): Anniversary->New arrives->Discount; For example: getPath(12): Anniversary->New arrives; For example: getPath(1): Anniversary; For example: getPath(6): Birthday; How can I do this? Thanks!

I am working on an assignment where one of the problems asks to derive an algorithm to check if a directed graph G=(V,E) is singly connected (there is at most one simple path from u to v for all distinct vertices u,v of V. Of course you can brute force check it, which is what I'm doing right now, but I want to know if there's a more efficient way. Could anyone point me in the right direction? Have you tried DFS . Run DFS for every vertex in the graph as source If a visited vertex is encountered again, the graph is not singly connected repeat for every unvisited vertex. The graph is singly