Determining the Reachability of a Digraph (UMAP)

This module provides an investigation of digraphs, including the determination of the existence of paths from point A to point B. Once reachability is determined, the question of how many paths exist of particular lengths is discussed and answered. Definitions are introduced and matrix representation described.

Table of Contents:

1. INTRODUCTION

2. DEFINITIONS AND EXAMPLES

3. PROPERTIES OF THE MATRIX OF A DIGRAPH

4. THE REACHABILITY MATRIX

5. REERENCES

6. BIBLIOGRAPHY

7. ANSWERS TO EXERCISES