adjacent table g

for N+2 points
  g[i][j] = time-of-foot
for connections
  g[i][j] = time-of-metro

And then I run shortest path. from 0 to n+1