{"id":16272000,"url":"https://github.com/logcreative/graphgendecomp","last_synced_at":"2025-09-17T23:15:12.174Z","repository":{"id":168638049,"uuid":"315641441","full_name":"LogCreative/GraphGenDecomp","owner":"LogCreative","description":"问题求解与实践课程大作业","archived":false,"fork":false,"pushed_at":"2021-04-23T11:25:58.000Z","size":10630,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-08T15:50:14.132Z","etag":null,"topics":[],"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/LogCreative.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":"2020-11-24T13:31:12.000Z","updated_at":"2021-04-23T11:22:18.000Z","dependencies_parsed_at":null,"dependency_job_id":"0da9c338-6a06-4dc6-987a-699f3ac78127","html_url":"https://github.com/LogCreative/GraphGenDecomp","commit_stats":null,"previous_names":["logcreative/graphgendecomp"],"tags_count":5,"template":false,"template_full_name":null,"purl":"pkg:github/LogCreative/GraphGenDecomp","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LogCreative%2FGraphGenDecomp","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LogCreative%2FGraphGenDecomp/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LogCreative%2FGraphGenDecomp/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LogCreative%2FGraphGenDecomp/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/LogCreative","download_url":"https://codeload.github.com/LogCreative/GraphGenDecomp/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/LogCreative%2FGraphGenDecomp/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275680517,"owners_count":25508589,"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-09-17T02:00:09.119Z","response_time":84,"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":[],"created_at":"2024-10-10T18:15:44.608Z","updated_at":"2025-09-17T23:15:12.147Z","avatar_url":"https://github.com/LogCreative.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 图生成与分解器\n2020年秋季 问题求解与实践大作业\n\n![](https://cdn.jsdelivr.net/gh/LogCreative/GraphGenDecomp/report/header.png)\n\n\u003e Copyright (C) 2020 by LogCreative, All Rights Reserved. To learn more about the author, please visit https://github.com/LogCreative .\n\u003e\n\u003e (LC) No. 0211\n\n![](./report/program.gif)\n\n## 存储库说明\n\n### 使用\n可以在 [发布栏](https://github.com/LogCreative/GraphGenDecomp/releases) 看到该软件的 Windows 发布版。（其余版本的编译正在尝试，欢迎PR）该软件可以随机生成子图，并根据比较有时间效率的启发式算法分割图形以限制每个子图的大小，有时间预期并可视化图。\n\n\u003e **2021/4 更新** feat: AlgComplexity HW08 可以通过子文件目录中的 ``partition.txt`` 获取划分信息，对主图进行手动划分，以便进行可视化。子图目录暂时不支持中文目录。\n\n### 编译\n需要在 Visual Studio 2019 的 include 文件夹加入 FL 的头文件以及 lib 文件夹加入已经编译好的 FLTK 库文件。或者仅查看命令行未使用 FLTK 库的部分。请将输出从 x64 调整为 x86，因为 FLTK 不支持 64 位平台的编译，需要预编译头 `WIN32`。\n\n### 结构\n\n```\nGraphGenDecomp\n\t|-GraphDecomp 分解器主代码\n\t\t|-GraphDecomp.h 分解器头文件定义\n\t\t|-GraphDecomp.cpp 分解器代码\n\t\t|-DecompMain.cpp 分解器命令行\n\t|-GraphDecomposerUI 分解器UI\n\t\t|-Decomposer.cpp 分解器UI\n\t|-GraphGen 生成器代码\n\t\t|-GraphGen.h 生成器头文件定义\n\t\t|-GraphGen.cpp 生成器代码\n\t\t|-GenMain.cpp 生成器命令行\n\t|-GraphGenDecomp 主UI与图预览代码\n\t\t|-MainWindow.cpp 主UI\n\t\t|-GraphView.hpp 图预览代码\n\t|-GraphGeneratorUI 生成器UI\n\t\t|-Generator.cpp 生成器UI\n\t|-report 报告\n\t\t|-GraphGenDecomp.tex 报告代码\n\t|-GraphGenDecomp.sln VS工程文件\n\t|-GUI_facilities.h FLTK 库必要头文件\n\t|-std_lib_facilities.h 存放 STL 必要头文件\n```\n\n### 原理\n\n更为详尽的说明，请见 [项目报告](https://github.com/LogCreative/GraphGenDecomp/blob/master/report/GraphGenDecomp.pdf)。\n\n## 问题重述\n\n1. 开发一个图自动生成器: 随机生成一个有向图，将图放置到指定文件中，每一行如下格式\n    - \u003c节点编号\u003e：节点\n\t- \u003c出发节点编号、结束节点编号、权重\u003e：有向边\n2. 开发一个图分解器\n    - 分割图文件\n     \t- 将上述图分为若干子图，每个子图中节点数不大于 n。\n     \t- A图分割后，每个子图可以用单独的文件保存：如 A1,A2,A3,...\n     \t- 令子图之间的交互（即能够跨越子图边界的边）权重之和最小\n     \t- 我们将挑选若干自动生成的图，对比大家生成的权重之和值。在结果正确的前提下，计算权重之和越小，分数越高。\n         \t- 优化子图存储\n     \t- 上述图分割算法导致分割成的多个子图之间存在重复的节点，请设计一个方法，使\n          \t- 多个子图文件中分别载入程序后，不存在重复的节点\n     \t- 每个子图可以最多增加一个虚节点（如子图的文件名），代表外界（即其他子图）对该子图的引用\n     \t- 设计一个算法，将多个子图合并及删除虚节点后，检查与原图A一致。输出分割边的权重和。\n    - 子图上算法\n     \t- 指定一个点，列出计算所有经有向边可达的节点\n     \t- 指定两个点，输出最短路径\n     \t- 如果指定的节点不存在，报错即可\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flogcreative%2Fgraphgendecomp","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flogcreative%2Fgraphgendecomp","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flogcreative%2Fgraphgendecomp/lists"}