{"id":16717837,"url":"https://github.com/xoolive/graphs","last_synced_at":"2025-03-15T10:12:51.271Z","repository":{"id":90234818,"uuid":"144981347","full_name":"xoolive/graphs","owner":"xoolive","description":"Materials for shortest paths problems with networkx","archived":false,"fork":false,"pushed_at":"2019-02-20T19:53:53.000Z","size":68147,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-01-22T00:49:33.849Z","etag":null,"topics":["astar-algorithm","dijkstra-algorithm","graphs","networkx-tutorial","shortest-path"],"latest_commit_sha":null,"homepage":null,"language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/xoolive.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"license.md","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2018-08-16T11:56:21.000Z","updated_at":"2021-08-12T21:26:35.000Z","dependencies_parsed_at":null,"dependency_job_id":"19628fee-22e8-401e-8d40-fc7d3319431c","html_url":"https://github.com/xoolive/graphs","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xoolive%2Fgraphs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xoolive%2Fgraphs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xoolive%2Fgraphs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xoolive%2Fgraphs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/xoolive","download_url":"https://codeload.github.com/xoolive/graphs/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243713420,"owners_count":20335567,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["astar-algorithm","dijkstra-algorithm","graphs","networkx-tutorial","shortest-path"],"created_at":"2024-10-12T21:34:08.098Z","updated_at":"2025-03-15T10:12:51.251Z","avatar_url":"https://github.com/xoolive.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nYou will need a working Python environment. Anaconda is recommended.\n\nThe `networkx` package is required:\n```sh\npip install networkx\n```\n\nTo download the materials:\n```sh\ngit clone https://github.com/letstrythat/graphs\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxoolive%2Fgraphs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fxoolive%2Fgraphs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxoolive%2Fgraphs/lists"}