Implementation for Dijkstra's Algorithm in Java
The place in code where the vertex are initialized, you initialize all your bus routes.
In place where adjacency matrix is defined, for each of your stop initialize with stops where buses are available. Now run the algorithm. You might keep additional info along each edge such as possible bus numbers.