Github
从github.com提取项目列表、开发者信息、代码仓库详情、星标数量、分支版本、贡献者记录、issue反馈、项目许可证信息等数据。
3 个工具更新时间 2026.05.13
概览
请求参数
| 参数名 | 说明 |
|---|---|
| 仓库URL | 该参数用于指定要采集的仓库 URL。 |
返回字段
| 字段名 | 类型 | 说明 |
|---|---|---|
| breadcrumbs | Array | 仓库导航路径 |
| code | Array | 仓库源代码 |
| code_language | Text | 主要编程语言 |
| id | Text | 唯一仓库ID |
| input | Object | input |
| last_feature | Text | 最新功能变更 |
| latest_update | Date | 最后更新日期 |
| num_fork | Number | 复刻数 |
| num_issues | Number | 问题总数 |
| num_lines | Number | 代码总行数 |
| num_projects | Number | 关联项目数量 |
| num_pull_requests | Number | 拉取请求总数 |
| num_stared | Number | 星标数 |
| size | Text | 仓库大小 |
| size_num | Number | 仓库大小数值 |
| size_unit | Text | 仓库大小单位 |
| url | Url | 仓库网址 |
| user_name | Text | 仓库所有者的用户名 |
| user_url | Url | 所有者个人资料网址 |
示例响应
JSON 预览
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
[ { "url": "https://github.com/TheAlgorithms/Python/blob/master/dynamic_programming/subset_generation.py", "id": 63476337, "code_language": "Python", "code": [ "def subset_combinations(elements: list[int], n: int) -> list:", " \"\"\"", " Compute n-element combinations from a given list using dynamic programming.", "ID-20260115-001", " Args:", " * `elements`: The list of elements from which combinations will be generated.", " * `n`: The number of elements in each combination.", "ID-20260115-001", " Returns:", " A list of tuples, each representing a combination of `n` elements.", "ID-20260115-001", " >>> subset_combinations(elements=[10, 20, 30, 40], n=2)", " [(10, 20), (10, 30), (10, 40), (20, 30), (20, 40), (30, 40)]", " >>> subset_combinations(elements=[1, 2, 3], n=1)", " [(1,), (2,), (3,)]", " >>> subset_combinations(elements=[1, 2, 3], n=3)", " [(1, 2, 3)]", " >>> subset_combinations(elements=[42], n=1)", " [(42,)]", " >>> subset_combinations(elements=[6, 7, 8, 9], n=4)", " [(6, 7, 8, 9)]", " >>> subset_combinations(elements=[10, 20, 30, 40, 50], n=0)", " [()]", " >>> subset_combinations(elements=[1, 2, 3, 4], n=2)", " [(1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)]", " >>> subset_combinations(elements=[1, 'apple', 3.14], n=2)", " [(1, 'apple'), (1, 3.14), ('apple', 3.14)]", " >>> subset_combinations(elements=['single'], n=0)", " [()]", " >>> subset_combinations(elements=[], n=9)", " []", " >>> from itertools import combinations", " >>> all(subset_combinations(items, n) == list(combinations(items, n))", " ... for items, n in (", " ... ([10, 20, 30, 40], 2), ([1, 2, 3], 1), ([1, 2, 3], 3), ([42], 1),", " ... ...
