{"id":15475993,"url":"https://github.com/camilamaia/graph","last_synced_at":"2025-03-28T13:26:41.713Z","repository":{"id":10485289,"uuid":"12664769","full_name":"camilamaia/graph","owner":"camilamaia","description":"A implementation of Dijkstra's algorithm for finding the shortest paths between nodes in a graph","archived":false,"fork":false,"pushed_at":"2018-02-19T14:21:21.000Z","size":17,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2024-10-19T02:29:34.149Z","etag":null,"topics":["graph","python","python-2","university-project"],"latest_commit_sha":null,"homepage":"https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/camilamaia.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-09-07T12:47:33.000Z","updated_at":"2019-11-06T06:50:18.000Z","dependencies_parsed_at":"2022-07-30T12:17:59.060Z","dependency_job_id":null,"html_url":"https://github.com/camilamaia/graph","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/camilamaia%2Fgraph","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/camilamaia%2Fgraph/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/camilamaia%2Fgraph/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/camilamaia%2Fgraph/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/camilamaia","download_url":"https://codeload.github.com/camilamaia/graph/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246036278,"owners_count":20713216,"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":["graph","python","python-2","university-project"],"created_at":"2024-10-02T03:21:48.653Z","updated_at":"2025-03-28T13:26:41.687Z","avatar_url":"https://github.com/camilamaia.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"Graph - Dijkstra's Algorithm Implementation\n=====\n\nA implementation of Dijkstra's algorithm for finding the shortest paths between nodes in a given graph.\n\nSoftware developed for the Graph Class INE5413, of the Department of Informatics and Statistics of the Federal University of Santa Catariana in the second semester of 2013.\n\n## How to Run\n\nInside the project directory, run: \n\n```bash\n    $ ./bin/graph\n```\n\nBy default, the script uses the graph below to calculate the shortest paths between nodes:\n\n```python\n    {\n       A {'B': 7, 'G': 3, 'F': 5}\n       C {'B': 2, 'E': 3, 'D': 5, 'G': 2}\n       B {'A': 7, 'C': 2, 'G': 3}\n       E {'C': 3, 'D': 4, 'G': 4, 'F': 6}\n       D {'C': 5, 'E': 4}\n       G {'A': 3, 'C': 2, 'B': 3, 'E': 4, 'F': 3}\n       F {'A': 5, 'E': 6, 'G': 3}\n    }\n```\n\nIf you want to provide your own graph, run the script with the `Create your own graph` option:\n\n```bash\n    $ ./bin/graph -c\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcamilamaia%2Fgraph","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcamilamaia%2Fgraph","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcamilamaia%2Fgraph/lists"}