Good morning! Here's your coding interview problem for today.
This problem was asked by Yahoo.
Write an algorithm that computes the reversal of a directed graph. For example, if a graph consists of A -> B -> C, it should become A <- B <- C.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Good morning! Here's your coding interview problem for today.
This problem was asked by Yahoo.
Write an algorithm that computes the reversal of a directed graph. For example, if a graph consists of A -> B -> C, it should become A <- B <- C.