-
Notifications
You must be signed in to change notification settings - Fork 19
/
setup.py
130 lines (121 loc) · 3.03 KB
/
setup.py
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
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
"""
graph-theory
"""
from setuptools import setup
from pathlib import Path
root = Path(__file__).parent
__version__ = None
version_file = root / "graph" / "version.py"
exec(version_file.read_text())
assert isinstance(__version__, str) # noqa
with open(root / "README.md", encoding="utf-8") as f:
long_description = f.read()
with open(root / "requirements.txt", "r", encoding="utf-8") as fi:
requirements = [v.rstrip("\n") for v in fi.readlines()]
keywords = list(
{
"complex-networks",
"discrete mathematics",
"graph",
"Graph Theory",
"graph-algorithms",
"graph-analysis",
"analysis",
"algorithms",
"graph-generation",
"graph-theory",
"graph-visualization",
"graphs",
"math",
"Mathematics",
"maths",
"generation",
"generate",
"theory",
"minimum-spanning-trees",
"network",
"Networks",
"optimization",
"python",
"shortest-path",
"tsp",
"tsp-solver",
"minimum",
"spanning",
"tree",
"assignment problem",
"flow-problem",
"hash",
"graph-hash",
"random graph",
"search",
"cycle",
"path",
"flow",
"path",
"shortest",
"component",
"components",
"adjacency",
"matrix",
"all pairs shortest path",
"finite state machine",
"fsm",
"adjacent",
"pairs",
"finite",
"state",
"machine",
"traffic-jam",
"traffic-jam-solver",
"solver",
"hill-climbing",
"simple",
"simple-path",
"critical",
"path",
"congestions",
"jam",
"traffic",
"optimisation",
"method",
"critical-path",
"minimize",
"minimise",
"optimize",
"optimise",
"merkle",
"tree",
"merkle-tree",
"hash-tree",
}
)
keywords.sort(key=lambda x: x.lower())
setup(
name="graph-theory",
version=__version__,
url="https://github.com/root-11/graph-theory",
license="MIT",
author="https://github.com/root-11",
description="A graph library",
long_description=long_description,
long_description_content_type="text/markdown",
keywords=keywords,
packages=["graph"],
python_requires=">=3.7",
include_package_data=True,
data_files=[(".", ["LICENSE", "README.md", "requirements.txt"])],
platforms="any",
install_requires=requirements,
classifiers=[
"Development Status :: 5 - Production/Stable",
"Intended Audience :: Science/Research",
"Natural Language :: English",
"License :: OSI Approved :: MIT License",
"Programming Language :: Python :: 3.7",
"Programming Language :: Python :: 3.8",
"Programming Language :: Python :: 3.9",
"Programming Language :: Python :: 3.10",
"Programming Language :: Python :: 3.11",
],
)