{{ message }}
finished all algorithms#4
Open
MatterMu wants to merge 1 commit into
Open
Conversation
There was a problem hiding this comment.
Pull request overview
该 PR 主要新增/补齐了一系列“数据结构与算法”的可视化示例代码与对应的可视化输出 JSON,用于测试/演示 Graphite 的代码审查能力,并集中加入了 KMP、Prim、Kruskal、DFS/BFS、二叉树遍历、堆操作等可视化实现。
Changes:
- 新增 KMP 的多份可视化实现与回放 JSON(含不同命名/界面语言版本)。
- 新增/整理多种算法可视化示例:Prim、Kruskal、DFS/BFS(树/图)、二叉树遍历(先/中/后序)、最大堆插入/删除等。
- 增加若干用于演示/测试的 JSON 回放文件与 VSCode 配置。
Reviewed changes
Copilot reviewed 35 out of 54 changed files in this pull request and generated 8 comments.
Show a summary per file
| File | Description |
|---|---|
| visual_KMP.cpp | 基于 std::string 的 KMP 可视化实现示例 |
| vision_visualization.json | KMP 可视化回放 JSON(Pattern/String/Console) |
| vision_KMP.cpp | 基于 char* 的 KMP 可视化实现示例(中文 tracer 名称) |
| test/visualization.json | 测试用可视化回放 JSON(array/graph/log 等) |
| pure_Prim.cpp | Prim 的纯算法示例实现(非可视化) |
| dijkstra.json | Dijkstra 可视化回放 JSON |
| dijkstra.cpp | Dijkstra 可视化示例代码 |
| KMP-test.json | KMP-test 可视化回放 JSON |
| KMP-test.cpp | KMP 可视化测试代码(带表头列偏移的 2D tracer 表) |
| Finished/Prim/Prim.cpp | Prim 可视化成品代码(图 + 数组 + 日志) |
| Finished/Kruskal/Kruskal.cpp | Kruskal 可视化成品代码(含 parents 数组展示) |
| Finished/KMP/KMP.json | Finished/KMP 的可视化回放 JSON |
| Finished/KMP/KMP.cpp | Finished/KMP 的可视化成品代码 |
| Finished/HeapOperations/Heap-Insert.json | 最大堆插入操作回放 JSON |
| Finished/HeapOperations/Heap-Insert.cpp | 最大堆插入操作可视化代码 |
| Finished/HeapOperations/Heap-DeleteMax.json | 最大堆删除最大值回放 JSON |
| Finished/HeapOperations/Heap-DeleteMax.cpp | 最大堆删除最大值可视化代码 |
| Finished/DFS/DFS-Tree.json | DFS(树)回放 JSON |
| Finished/DFS/DFS-Tree.cpp | DFS(树)可视化代码 |
| Finished/DFS/DFS-Graph.json | DFS(图)回放 JSON |
| Finished/DFS/DFS-Graph.cpp | DFS(图)可视化代码 |
| Finished/Binary-Tree-Traversal/PreOrder.json | 二叉树先序遍历回放 JSON |
| Finished/Binary-Tree-Traversal/PreOrder.cpp | 二叉树先序遍历可视化代码 |
| Finished/Binary-Tree-Traversal/PostOrder.json | 二叉树后序遍历回放 JSON |
| Finished/Binary-Tree-Traversal/PostOrder.cpp | 二叉树后序遍历可视化代码 |
| Finished/Binary-Tree-Traversal/InOrder.json | 二叉树中序遍历回放 JSON |
| Finished/Binary-Tree-Traversal/InOrder.cpp | 二叉树中序遍历可视化代码 |
| Finished/BFS/BFS-Tree.json | BFS(树)回放 JSON(含队列展示) |
| Finished/BFS/BFS-Tree.cpp | BFS(树)可视化代码(含队列 tracer) |
| Finished/BFS/BFS-Graph.json | BFS(图)回放 JSON(含队列展示) |
| Finished/BFS/BFS-Graph.cpp | BFS(图)可视化代码(含队列 tracer) |
| Delete-test.cpp | DeleteMax 的另一份测试/演示实现 |
| .vscode/settings.json | VSCode 文件关联设置 |
💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.
Sorry, something went wrong.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.
完成了所有数据结构与算法的可视化,测试Graphite的代码审查功能