https://github.com/mfarragher/london-tube
Modelling of London's Tube network: shortest path function; graph link analysis
https://github.com/mfarragher/london-tube
graph-algorithms london london-travel london-underground python transportation-network
Last synced: 7 months ago
JSON representation
Modelling of London's Tube network: shortest path function; graph link analysis
- Host: GitHub
- URL: https://github.com/mfarragher/london-tube
- Owner: mfarragher
- License: gpl-3.0
- Created: 2017-11-12T14:18:27.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2017-11-12T14:22:41.000Z (about 8 years ago)
- Last Synced: 2025-02-26T15:06:36.823Z (9 months ago)
- Topics: graph-algorithms, london, london-travel, london-underground, python, transportation-network
- Language: Jupyter Notebook
- Homepage:
- Size: 24.4 KB
- Stars: 8
- Watchers: 1
- Forks: 4
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# london-tube
Modelling of London's Tube network: shortest path function; graph link analysis
# Objectives
__These are the two challenges I have sought to tackle so far in this project:__
* Calculate the shortest path between two stations.
* Perform graph analysis / link analysis on the network.
# Features
Key features of the dataset:
* Undirected graph
* Interchange data
Includes all the TfL rail connections in London up to 2017 (excl. TfL Rail and Tramlink): e.g. all London Overground lines.
# Licence
This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details: .
© 2017 exmachinadata.com