{"id":16332854,"url":"https://github.com/kevinbird61/chinese-postman-problem","last_synced_at":"2025-06-13T03:37:33.630Z","repository":{"id":83114299,"uuid":"170354422","full_name":"kevinbird61/chinese-postman-problem","owner":"kevinbird61","description":"Project of Course - Graph Theory (EE6622E) in National Cheng Kung University.","archived":false,"fork":false,"pushed_at":"2019-02-27T06:12:33.000Z","size":20,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-15T22:39:12.352Z","etag":null,"topics":["fake","mininet"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/kevinbird61.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}},"created_at":"2019-02-12T16:46:22.000Z","updated_at":"2022-09-27T11:18:46.000Z","dependencies_parsed_at":"2023-03-05T14:00:18.737Z","dependency_job_id":null,"html_url":"https://github.com/kevinbird61/chinese-postman-problem","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/kevinbird61/chinese-postman-problem","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kevinbird61%2Fchinese-postman-problem","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kevinbird61%2Fchinese-postman-problem/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kevinbird61%2Fchinese-postman-problem/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kevinbird61%2Fchinese-postman-problem/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/kevinbird61","download_url":"https://codeload.github.com/kevinbird61/chinese-postman-problem/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/kevinbird61%2Fchinese-postman-problem/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259574578,"owners_count":22878745,"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":["fake","mininet"],"created_at":"2024-10-10T23:33:17.177Z","updated_at":"2025-06-13T03:37:33.479Z","avatar_url":"https://github.com/kevinbird61.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Chinese Postman Problem\nProject of Course - Graph Theory (EE6622E) in National Cheng Kung University.\n\n## Build \u0026 Run\n\n```sh\n# Clone\n$ git clone --recursive https://github.com/kevinbird61/chinese-postman-problem.git\n# Build the library first\n$ cd fake-mininet/ \u0026\u0026 make lib \u0026\u0026 cd ..\n# Copy the libfakemn.a to root\n$ cp fake-mininet/libfakemn.a .\n# Build the code \n$ make\n# Run \n$ ./main.out\n```\n\n## Concepts we need\n\n* Graph (Edge, Vertex) - chapter 1\n* Distance - chapter 2\n* Matching - chapter 3\n* Connectivities - chapter 4\n* Dijkstra\n* Eulerian circuit\n\n## Description of Program\n\n1. If current graph is Eulerian ?\n    * Yes:  Find one of Eularian path/trail (shortest path) can solve chinese postman problem.\n    * No:   Goto next phase.\n2. If not Eulerian:\n    * Find all `odd` degree points, then using these points into a `complete graph`.\n    * Mapping those `new` edges of complete graph back to origin graph. (It will be some new edges)\n    * Now we have Eulerian, back to Step 1.\n3. After finding an Eulerian path/trail, if there have any `new` edges in this path/trail, then replace it with an alternative path in original graph. (Using `fake-mininet` API to give these `new` edges a \"tag\", and if detect this special tag, then replace it with an alternative.)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkevinbird61%2Fchinese-postman-problem","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkevinbird61%2Fchinese-postman-problem","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkevinbird61%2Fchinese-postman-problem/lists"}