{"id":17645177,"url":"https://github.com/hauke96/master-thesis","last_synced_at":"2026-01-07T23:07:10.652Z","repository":{"id":185145715,"uuid":"506981057","full_name":"hauke96/master-thesis","owner":"hauke96","description":"My master thesis presenting a hybrid graph-based and geometric routing algorithm. This repo contains the code and thesis.","archived":false,"fork":false,"pushed_at":"2023-09-18T21:07:08.000Z","size":34799,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":4,"default_branch":"main","last_synced_at":"2025-02-05T09:18:06.887Z","etag":null,"topics":["agent-based","geometric-shortest-path","routing-algorithm","routing-engine","shortest-path-algorithm"],"latest_commit_sha":null,"homepage":"","language":"TeX","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"cc0-1.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/hauke96.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":"2022-06-24T11:12:10.000Z","updated_at":"2023-08-20T19:42:39.000Z","dependencies_parsed_at":"2024-10-23T13:58:19.701Z","dependency_job_id":null,"html_url":"https://github.com/hauke96/master-thesis","commit_stats":null,"previous_names":["hauke96/master-thesis"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hauke96%2Fmaster-thesis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hauke96%2Fmaster-thesis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hauke96%2Fmaster-thesis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/hauke96%2Fmaster-thesis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/hauke96","download_url":"https://codeload.github.com/hauke96/master-thesis/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246285820,"owners_count":20752957,"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":["agent-based","geometric-shortest-path","routing-algorithm","routing-engine","shortest-path-algorithm"],"created_at":"2024-10-23T10:53:27.663Z","updated_at":"2026-01-07T23:07:10.618Z","avatar_url":"https://github.com/hauke96.png","language":"TeX","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Master thesis\n\nThis repository contains all content for my master thesis *A Hybrid Algorithm for Finding Shortest Paths Between Arbitrary Coordinates using a Combination of Network and Geometric Routing*.\n\n## Branches\n\n* `main`: The main branch on which the actual code and thesis is located.\n* `performance-evaluation`: Content of the main branch plus adjustments to the code (measuring performance), used datasets (or scripts to generate them), all measurement results and visualization scripts.\n* Other branches: Some features features were tested and abandoned later. They might still exist on other branches.\n\n## Folder structure\n\n* [`code`](./code): the C# solution of the *hybrid routing algorithm* including some example projects.\n* [`thesis`](./thesis): Thesis including bibliography and images.\n* [`presentation`](./presentation): Presentation of my defense.\n* [`notes`](./notes): Personal notes on various things (not necessarily up-to-date).\n* [`doc`](./doc): Documentation and additional information on the code. Not necessarily up-to-date but those passages are marked accordingly.\n* [`misc`](./misc): Scripts used to measure smaller things mentioned in the thesis.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhauke96%2Fmaster-thesis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhauke96%2Fmaster-thesis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhauke96%2Fmaster-thesis/lists"}