Get adjacent vertices in directed acyclic graph

Topics: algorithm, graph
Aug 29, 2014 at 2:11 PM
Given a vertex in a DAG, how can I get it's adjacent vertices? Does a vertex have knowledge of it's adjacents?

I am trying to use a graph with the Task Parallel Library, where each task is represented by a vertex, and that task's dependencies are represented by adjacent vertices. A task must complete its dependent tasks (adjacent vertices) before starting its own work.