{"id":16771610,"url":"https://github.com/meysam81/graph-eulerian-path-circuit","last_synced_at":"2025-08-27T17:05:38.492Z","repository":{"id":99614657,"uuid":"114381840","full_name":"meysam81/Graph-Eulerian-Path-Circuit","owner":"meysam81","description":"A program for finding the Eulerian path/cycle in a huge sparse network","archived":false,"fork":false,"pushed_at":"2017-12-16T23:16:17.000Z","size":676,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-01-23T03:16:52.508Z","etag":null,"topics":["algorithm","euler","euler-exercises","euler-project","euler-solutions","eulerian","eulerproject","file","graph","mathematics","network"],"latest_commit_sha":null,"homepage":null,"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/meysam81.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}},"created_at":"2017-12-15T14:57:40.000Z","updated_at":"2017-12-15T16:29:09.000Z","dependencies_parsed_at":null,"dependency_job_id":"b7739a4e-a989-4aee-abc2-5a0fcec7d76d","html_url":"https://github.com/meysam81/Graph-Eulerian-Path-Circuit","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/meysam81%2FGraph-Eulerian-Path-Circuit","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/meysam81%2FGraph-Eulerian-Path-Circuit/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/meysam81%2FGraph-Eulerian-Path-Circuit/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/meysam81%2FGraph-Eulerian-Path-Circuit/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/meysam81","download_url":"https://codeload.github.com/meysam81/Graph-Eulerian-Path-Circuit/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243894036,"owners_count":20364946,"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":["algorithm","euler","euler-exercises","euler-project","euler-solutions","eulerian","eulerproject","file","graph","mathematics","network"],"created_at":"2024-10-13T06:28:46.248Z","updated_at":"2025-03-16T16:19:36.766Z","avatar_url":"https://github.com/meysam81.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph-Eulerian-Path-Circuit\nA program for finding the Eulerian path/cycle in a huge sparse network\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmeysam81%2Fgraph-eulerian-path-circuit","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmeysam81%2Fgraph-eulerian-path-circuit","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmeysam81%2Fgraph-eulerian-path-circuit/lists"}