Next: Problem 7 - Digital
Up: Information Science I
Previous: Problem 5 - Data
Answer the following questions regarding directed graphs.
- 1.
- Describe a data structure for representing a directed graph.
- 2.
- Write an algorithm that computes the shortest path.
- 3.
- Show the computational complexity of the algorithm discussed above
using the data structure discussed above.
See [SED00] for a detailed answer.
Reynald AFFELDT
2000-06-08