Question

Does anyone know where I can find an implementation of an algorithm to convert an activity node graph (aka activity-on-node graph) to an event node graph (aka activiy-on-arrow graph)?

If you don’t know what I am talking about, take a look here: http://www.brpreiss.com/books/opus7/html/page581.html

Please provide a working algo in your answer.

Thanks in advance.

Answer 1

The easiest thing to do is replace every node v in your original graph with two nodes, v_in and v_out, connected by a single edge with weight equal to the original vertex weight. Then replace all the original edges (u, v) with edges from u_out to v_in of zero weight.