GitHub / TrafficGCN / osmnx_adjacency_matrix_for_graph_convolutional_networks
Creating an Adjacency Matrix Using the Dijkstra Algorithm for Graph Convolutional Networks GCNs
Stars: 22
Forks: 2
Open issues: 0
License: mit
Language: Jupyter Notebook
Size: 46.9 MB
Dependencies parsed at: Pending
Created at: about 2 years ago
Updated at: about 1 month ago
Pushed at: about 1 year ago
Last synced at: 19 days ago
Topics: adjacency-matrix, data-science, dijkstra, dijkstra-algorithm, gcn, graph, graph-algorithms, graph-convolutional-networks, matrix, metrla, open-street-map, optimal-route, osm, osmnx, python, traffic, traffic-analysis, traffic-congestion