{"id":20705631,"url":"https://github.com/jaydattpatel/graphs-dijkstra-floyd-algorithm","last_synced_at":"2026-02-09T19:03:32.126Z","repository":{"id":185300160,"uuid":"620395019","full_name":"jaydattpatel/Graphs-Dijkstra-Floyd-Algorithm","owner":"jaydattpatel","description":"Different operation of Directed Graph or Undirected Graph using C++","archived":false,"fork":false,"pushed_at":"2024-08-01T16:00:16.000Z","size":15,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-22T19:31:41.105Z","etag":null,"topics":["adjacency-matrix","all-pairs-shortest-path","cpp","dijkstra","dijkstra-algorithm","dijkstra-shortest-path","directed-graph","distance-matrix","edges","floyd-warshall","graphs","incidence-matrix","object-oriented-programming","online-manipal-bca","shortest-paths","undirected-graphs","vertex","vertex-edge"],"latest_commit_sha":null,"homepage":"","language":"C++","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/jaydattpatel.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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,"zenodo":null}},"created_at":"2023-03-28T15:41:27.000Z","updated_at":"2024-08-07T13:52:10.000Z","dependencies_parsed_at":"2024-08-01T17:56:15.260Z","dependency_job_id":null,"html_url":"https://github.com/jaydattpatel/Graphs-Dijkstra-Floyd-Algorithm","commit_stats":null,"previous_names":["jaydattpatel/graphs","jaydattpatel/graphs-dijkstra-floyd-algorithm"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/jaydattpatel/Graphs-Dijkstra-Floyd-Algorithm","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaydattpatel%2FGraphs-Dijkstra-Floyd-Algorithm","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaydattpatel%2FGraphs-Dijkstra-Floyd-Algorithm/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaydattpatel%2FGraphs-Dijkstra-Floyd-Algorithm/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaydattpatel%2FGraphs-Dijkstra-Floyd-Algorithm/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jaydattpatel","download_url":"https://codeload.github.com/jaydattpatel/Graphs-Dijkstra-Floyd-Algorithm/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jaydattpatel%2FGraphs-Dijkstra-Floyd-Algorithm/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29277956,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-09T17:15:22.002Z","status":"ssl_error","status_checked_at":"2026-02-09T17:14:42.395Z","response_time":56,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.5:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["adjacency-matrix","all-pairs-shortest-path","cpp","dijkstra","dijkstra-algorithm","dijkstra-shortest-path","directed-graph","distance-matrix","edges","floyd-warshall","graphs","incidence-matrix","object-oriented-programming","online-manipal-bca","shortest-paths","undirected-graphs","vertex","vertex-edge"],"created_at":"2024-11-17T01:18:51.536Z","updated_at":"2026-02-09T19:03:27.117Z","avatar_url":"https://github.com/jaydattpatel.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graphs\n\u003cdiv id=\"badges\"\u003e\n  \u003cimg src=\"https://api.visitorbadge.io/api/visitors?path=jaydattpatel%2FGraphs-algorithams\u0026label=Visitors\u0026labelColor=%23720026\u0026countColor=%23ffae00\" alt=\"Visitor badge\" width=\"100\" height=\"28\"/\u003e\n\u003c/div\u003e\nDifferent operation of Directed Graph or Undirected Graph using C++\n\n![image](https://user-images.githubusercontent.com/124486498/228297883-b8314656-3712-4e39-986c-e637fc4f4b8e.png)\n![image](https://user-images.githubusercontent.com/124486498/228294424-cce0800f-41a2-4ba5-b97d-6f78f2a53dd8.png)\n![image](https://user-images.githubusercontent.com/124486498/228294629-78bd8c06-e974-44b8-9392-a09b57102087.png)\n![image](https://user-images.githubusercontent.com/124486498/228294773-be2e74f5-7295-48e0-8bc3-bc210f073ee9.png)\n![image](https://user-images.githubusercontent.com/124486498/228294982-a0cb1394-d258-4255-9ea3-add5ae8ce762.png)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaydattpatel%2Fgraphs-dijkstra-floyd-algorithm","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjaydattpatel%2Fgraphs-dijkstra-floyd-algorithm","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjaydattpatel%2Fgraphs-dijkstra-floyd-algorithm/lists"}