{"id":34501438,"url":"https://github.com/jconleyscales/graph-adjacency-matrix","last_synced_at":"2026-05-25T20:03:04.153Z","repository":{"id":329879226,"uuid":"1120862799","full_name":"jconleyscales/graph-adjacency-matrix","owner":"jconleyscales","description":"Undirected weighted graph utilities + Graph class (adjacency matrix) in Python.","archived":false,"fork":false,"pushed_at":"2025-12-22T04:28:03.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-12-23T15:48:31.248Z","etag":null,"topics":["adjacency-matrix","data-structures","graphs","python"],"latest_commit_sha":null,"homepage":"","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/jconleyscales.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-12-22T04:16:54.000Z","updated_at":"2025-12-22T04:28:06.000Z","dependencies_parsed_at":null,"dependency_job_id":null,"html_url":"https://github.com/jconleyscales/graph-adjacency-matrix","commit_stats":null,"previous_names":["jconleyscales/graph-adjacency-matrix"],"tags_count":null,"template":false,"template_full_name":null,"purl":"pkg:github/jconleyscales/graph-adjacency-matrix","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jconleyscales%2Fgraph-adjacency-matrix","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jconleyscales%2Fgraph-adjacency-matrix/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jconleyscales%2Fgraph-adjacency-matrix/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jconleyscales%2Fgraph-adjacency-matrix/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/jconleyscales","download_url":"https://codeload.github.com/jconleyscales/graph-adjacency-matrix/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/jconleyscales%2Fgraph-adjacency-matrix/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":27992996,"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","status":"online","status_checked_at":"2025-12-24T02:00:07.193Z","response_time":83,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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","data-structures","graphs","python"],"created_at":"2025-12-24T02:01:51.569Z","updated_at":"2025-12-24T02:02:11.538Z","avatar_url":"https://github.com/jconleyscales.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph (Adjacency Matrix) — Python\n\nUtilities and a `Graph` class for working with an undirected, weighted graph stored as an adjacency matrix.\n\n## Features\n- Helper functions to compute vertex/edge counts and shortest/longest edge weights\n- `find_popular()` to find the vertex with the most neighbors\n- `Graph` class with safe edge operations: `add_edge`, `adjust_edge`, `remove_edge`, `exists_edge`\n- Validation: bounds checking, no self-loops, non-negative weights\n\n## How to Run\n1. Make sure you have Python 3 installed.\n2. Run the file:\n\n```bash```\npython graph.py\n## Example Usage\n\n```python\nfrom graph import Graph\n\ng = Graph(5)\ng.add_edge(0, 1, 7)\ng.add_edge(0, 2, 3)\n\nprint(g.exists_edge(0, 1))  # True\ng.remove_edge(0, 1)\nprint(g.exists_edge(0, 1))  # False\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjconleyscales%2Fgraph-adjacency-matrix","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjconleyscales%2Fgraph-adjacency-matrix","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjconleyscales%2Fgraph-adjacency-matrix/lists"}