Forum: Computer Science May 22nd, 2005 |
| Replies: 1 Views: 3,263 What I want to achive is when given a directed graph, find out if there is one node that can reach every other node and if there is one node that can be reached by every other. Time complexity should... |