Priority Queue and Directed Acyclic Graph

I am given a task to write a C++ code for inserting intervals iteratively as key of a priority queue. Whenever i insert a new interval, i need to add an edge between two vertices in the DAG. Any pseudo code for this or any hints to write code for Priority queue and dag?