{"id":18313874,"url":"https://github.com/oeljeklaus-you/tempgraphpath","last_synced_at":"2025-09-12T00:33:22.083Z","repository":{"id":97009953,"uuid":"171596475","full_name":"oeljeklaus-you/TempGraphPath","owner":"oeljeklaus-you","description":"时序图单源最短路径算法","archived":false,"fork":false,"pushed_at":"2019-02-20T13:05:06.000Z","size":86,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-15T06:31:34.873Z","etag":null,"topics":["bfs-algorithm","dfs-algorithm","graph-algorithms","temporal-networks"],"latest_commit_sha":null,"homepage":null,"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/oeljeklaus-you.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-20T03:47:40.000Z","updated_at":"2019-02-20T13:05:08.000Z","dependencies_parsed_at":"2024-03-08T17:38:10.369Z","dependency_job_id":null,"html_url":"https://github.com/oeljeklaus-you/TempGraphPath","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/oeljeklaus-you%2FTempGraphPath","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oeljeklaus-you%2FTempGraphPath/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oeljeklaus-you%2FTempGraphPath/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/oeljeklaus-you%2FTempGraphPath/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/oeljeklaus-you","download_url":"https://codeload.github.com/oeljeklaus-you/TempGraphPath/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248038248,"owners_count":21037487,"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":["bfs-algorithm","dfs-algorithm","graph-algorithms","temporal-networks"],"created_at":"2024-11-05T16:29:00.986Z","updated_at":"2025-04-09T12:26:21.479Z","avatar_url":"https://github.com/oeljeklaus-you.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# TempGraphPath\n**时序图单源最短路径算法**\n## 四种基本的单源最短路径\n**最早抵达路径**：对于点u到v,如果存在一条u到v的路径且抵达v的时间最小,那么该路径为最早抵达路径。\n\n**最短抵达路径**：对于点u到v,如果存在一条u到v的路径且抵达v用的跳数最小,那么该路径为最晚离开路径。\n\n**最晚离开路径**：对于点u到v,如果存在一条u到v的路径且离开u的时间最大,那么该路径为最晚离开路径。\n\n**最快抵达路径**：对于点u到v,如果存在一条u到v的路径且离开u的时间与抵达v的时间之差最小,那么该路径\n\n为最晚离开路径。\n## 时序图四种基本路径\n![时序图](https://github.com/oeljeklaus-you/TempGraphPath/blob/master/temporalGraph.png)\n\n现在假设边上的数字表示为出发时间，持续时间均为1.\n\n一条时序路径如下:P = \u003c(a,f,3,1),(f,i,5,1),(i,l,8,1)\u003e,start(P) = 3, end(P) = 8+1 = 9, dura(P) = 9−3 = 6\n\nand dist(P) = 1 + 1 + 1 = 3.\n\n最早抵达路径为:min{end(P)},最短抵达路径:min{dist(P)},最快抵达路径:min{dura(P)},最晚离开路径:max{start(P)}.\n\n\n\n\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Foeljeklaus-you%2Ftempgraphpath","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Foeljeklaus-you%2Ftempgraphpath","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Foeljeklaus-you%2Ftempgraphpath/lists"}