This document describes a public transportation network as a weighted graph that can be used to find optimal paths between locations. It provides an example of finding the best route from origin L4-A to destination L6-A, listing the possible connections and their travel times.

1. Public Transportation Network

2. Path Finding Network: A weighted graph

6. Algorithm

7. Results Example L4-A (ORIGIN) L6-A (DESTINATION)

8. L4-A L4-B L4-C L1-E L3-B L3-D L6-B L6-A T822 T919 T149 T208