Graph processing by which to evacuate a mine

A continuing problem in underground mining is safe and timely evacuation in an emergency. This problem is addressed by showing (a) how underground mines can be represented as graphs which structurally conform to proper ventilation requirements, (b) how these graphs can be processes to detect and locate mine hazards, and (c) how theses graphs can further be processed to determine the safest escape paths away from a hazard, once it is located. The algorithms described will be an essential part of any expert system capable of managing and advising mine ventilation decisions in response to real time events.<
>