kap 0.2.1__tar.gz → 0.2.2__tar.gz
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- {kap-0.2.1 → kap-0.2.2}/PKG-INFO +23 -4
- {kap-0.2.1 → kap-0.2.2}/README.md +17 -2
- kap-0.2.2/kap/_version.py +1 -0
- {kap-0.2.1 → kap-0.2.2}/kap/assignment.py +1 -1
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/PKG-INFO +23 -4
- {kap-0.2.1 → kap-0.2.2}/setup.cfg +3 -0
- kap-0.2.1/kap/_version.py +0 -1
- {kap-0.2.1 → kap-0.2.2}/LICENSE.txt +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap/__init__.py +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap/_types.py +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/SOURCES.txt +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/dependency_links.txt +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/not-zip-safe +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/requires.txt +0 -0
- {kap-0.2.1 → kap-0.2.2}/kap.egg-info/top_level.txt +0 -0
- {kap-0.2.1 → kap-0.2.2}/setup.py +0 -0
{kap-0.2.1 → kap-0.2.2}/PKG-INFO
RENAMED
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
Metadata-Version: 2.
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
2
|
Name: kap
|
|
3
|
-
Version: 0.2.
|
|
3
|
+
Version: 0.2.2
|
|
4
4
|
Summary: Gabrovšek's Multiple Hungarian method for solving k-Assignment Problem.
|
|
5
5
|
Home-page: https://github.com/inspiros/kap
|
|
6
6
|
Author: Hoang-Nhat Tran (inspiros)
|
|
@@ -20,16 +20,20 @@ Classifier: Programming Language :: Python :: 3.8
|
|
|
20
20
|
Classifier: Programming Language :: Python :: 3.9
|
|
21
21
|
Classifier: Programming Language :: Python :: 3.10
|
|
22
22
|
Classifier: Programming Language :: Python :: 3.11
|
|
23
|
+
Classifier: Programming Language :: Python :: 3.12
|
|
24
|
+
Classifier: Programming Language :: Python :: 3.13
|
|
25
|
+
Classifier: Programming Language :: Python :: 3.14
|
|
23
26
|
Classifier: Operating System :: OS Independent
|
|
24
27
|
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
|
25
28
|
Requires-Python: >=3.7
|
|
26
29
|
Description-Content-Type: text/markdown
|
|
27
30
|
License-File: LICENSE.txt
|
|
28
31
|
Requires-Dist: numpy
|
|
32
|
+
Dynamic: license-file
|
|
29
33
|
|
|
30
34
|
``kap``: $k$-Assignment Problem Solver
|
|
31
35
|
======
|
|
32
|
-
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt)
|
|
36
|
+
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt) [](https://zenodo.org/doi/10.5281/zenodo.10449790)
|
|
33
37
|
|
|
34
38
|
This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for solving the **$k$-Assignment Problem**
|
|
35
39
|
(or **$k$-Partite Graph Matching Problem**), described in [this paper](https://www.mdpi.com/2227-7390/8/11/2050).
|
|
@@ -43,7 +47,7 @@ This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for
|
|
|
43
47
|
It is also traditionally referred to as **Multidimensional Assignment Problem**.
|
|
44
48
|
|
|
45
49
|
<p align="center">
|
|
46
|
-
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.
|
|
50
|
+
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.svg" width="300">
|
|
47
51
|
</p>
|
|
48
52
|
|
|
49
53
|
Formally, we seek a $k$-assignment of a given $k$-partite weighted graph $G = (V, E, \omega)$ with the minimum weight:
|
|
@@ -177,6 +181,21 @@ print("Total cost:", sum(matching_result.matching_costs))
|
|
|
177
181
|
|
|
178
182
|
These code blocks are extracted from [examples](examples).
|
|
179
183
|
|
|
184
|
+
## Citation
|
|
185
|
+
|
|
186
|
+
```bibtex
|
|
187
|
+
@software{inspiros_2024_10449791,
|
|
188
|
+
author = {Hoang-Nhat Tran},
|
|
189
|
+
title = {inspiros/kap: v0.2.1},
|
|
190
|
+
month = jan,
|
|
191
|
+
year = 2024,
|
|
192
|
+
publisher = {Zenodo},
|
|
193
|
+
version = {v0.2.1},
|
|
194
|
+
doi = {10.5281/zenodo.10449791},
|
|
195
|
+
url = {https://doi.org/10.5281/zenodo.10449791}
|
|
196
|
+
}
|
|
197
|
+
```
|
|
198
|
+
|
|
180
199
|
## License
|
|
181
200
|
|
|
182
201
|
MIT licensed. See [LICENSE.txt](LICENSE.txt).
|
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
``kap``: $k$-Assignment Problem Solver
|
|
2
2
|
======
|
|
3
|
-
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt)
|
|
3
|
+
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt) [](https://zenodo.org/doi/10.5281/zenodo.10449790)
|
|
4
4
|
|
|
5
5
|
This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for solving the **$k$-Assignment Problem**
|
|
6
6
|
(or **$k$-Partite Graph Matching Problem**), described in [this paper](https://www.mdpi.com/2227-7390/8/11/2050).
|
|
@@ -14,7 +14,7 @@ This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for
|
|
|
14
14
|
It is also traditionally referred to as **Multidimensional Assignment Problem**.
|
|
15
15
|
|
|
16
16
|
<p align="center">
|
|
17
|
-
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.
|
|
17
|
+
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.svg" width="300">
|
|
18
18
|
</p>
|
|
19
19
|
|
|
20
20
|
Formally, we seek a $k$-assignment of a given $k$-partite weighted graph $G = (V, E, \omega)$ with the minimum weight:
|
|
@@ -148,6 +148,21 @@ print("Total cost:", sum(matching_result.matching_costs))
|
|
|
148
148
|
|
|
149
149
|
These code blocks are extracted from [examples](examples).
|
|
150
150
|
|
|
151
|
+
## Citation
|
|
152
|
+
|
|
153
|
+
```bibtex
|
|
154
|
+
@software{inspiros_2024_10449791,
|
|
155
|
+
author = {Hoang-Nhat Tran},
|
|
156
|
+
title = {inspiros/kap: v0.2.1},
|
|
157
|
+
month = jan,
|
|
158
|
+
year = 2024,
|
|
159
|
+
publisher = {Zenodo},
|
|
160
|
+
version = {v0.2.1},
|
|
161
|
+
doi = {10.5281/zenodo.10449791},
|
|
162
|
+
url = {https://doi.org/10.5281/zenodo.10449791}
|
|
163
|
+
}
|
|
164
|
+
```
|
|
165
|
+
|
|
151
166
|
## License
|
|
152
167
|
|
|
153
168
|
MIT licensed. See [LICENSE.txt](LICENSE.txt).
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
__version__ = '0.2.2'
|
|
@@ -182,7 +182,7 @@ class KPartiteGraph:
|
|
|
182
182
|
cost_ij[:, n_matches_12 + n_free_1:] = cost_i2[:, free_2]
|
|
183
183
|
quotient_cost_matrices.append(cost_ij)
|
|
184
184
|
else:
|
|
185
|
-
quotient_cost_matrices.append(self[i, j].
|
|
185
|
+
quotient_cost_matrices.append(self[i, j].copy())
|
|
186
186
|
|
|
187
187
|
quotient_node_indices = KPartiteNamedNodeList()
|
|
188
188
|
for i in range(self.n_partites - 1):
|
|
@@ -1,6 +1,6 @@
|
|
|
1
|
-
Metadata-Version: 2.
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
2
|
Name: kap
|
|
3
|
-
Version: 0.2.
|
|
3
|
+
Version: 0.2.2
|
|
4
4
|
Summary: Gabrovšek's Multiple Hungarian method for solving k-Assignment Problem.
|
|
5
5
|
Home-page: https://github.com/inspiros/kap
|
|
6
6
|
Author: Hoang-Nhat Tran (inspiros)
|
|
@@ -20,16 +20,20 @@ Classifier: Programming Language :: Python :: 3.8
|
|
|
20
20
|
Classifier: Programming Language :: Python :: 3.9
|
|
21
21
|
Classifier: Programming Language :: Python :: 3.10
|
|
22
22
|
Classifier: Programming Language :: Python :: 3.11
|
|
23
|
+
Classifier: Programming Language :: Python :: 3.12
|
|
24
|
+
Classifier: Programming Language :: Python :: 3.13
|
|
25
|
+
Classifier: Programming Language :: Python :: 3.14
|
|
23
26
|
Classifier: Operating System :: OS Independent
|
|
24
27
|
Classifier: Topic :: Scientific/Engineering :: Mathematics
|
|
25
28
|
Requires-Python: >=3.7
|
|
26
29
|
Description-Content-Type: text/markdown
|
|
27
30
|
License-File: LICENSE.txt
|
|
28
31
|
Requires-Dist: numpy
|
|
32
|
+
Dynamic: license-file
|
|
29
33
|
|
|
30
34
|
``kap``: $k$-Assignment Problem Solver
|
|
31
35
|
======
|
|
32
|
-
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt)
|
|
36
|
+
[](https://github.com/inspiros/kap/actions) [](https://pypi.org/project/kap) [](https://pepy.tech/project/kap) [](https://github.com/inspiros/kap/blob/master/LICENSE.txt) [](https://zenodo.org/doi/10.5281/zenodo.10449790)
|
|
33
37
|
|
|
34
38
|
This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for solving the **$k$-Assignment Problem**
|
|
35
39
|
(or **$k$-Partite Graph Matching Problem**), described in [this paper](https://www.mdpi.com/2227-7390/8/11/2050).
|
|
@@ -43,7 +47,7 @@ This project implements **Boštjan Gabrovšek**'s Multiple Hungarian Methods for
|
|
|
43
47
|
It is also traditionally referred to as **Multidimensional Assignment Problem**.
|
|
44
48
|
|
|
45
49
|
<p align="center">
|
|
46
|
-
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.
|
|
50
|
+
<img src="https://raw.githubusercontent.com/inspiros/kap/master/resources/tripartite_matching_example.svg" width="300">
|
|
47
51
|
</p>
|
|
48
52
|
|
|
49
53
|
Formally, we seek a $k$-assignment of a given $k$-partite weighted graph $G = (V, E, \omega)$ with the minimum weight:
|
|
@@ -177,6 +181,21 @@ print("Total cost:", sum(matching_result.matching_costs))
|
|
|
177
181
|
|
|
178
182
|
These code blocks are extracted from [examples](examples).
|
|
179
183
|
|
|
184
|
+
## Citation
|
|
185
|
+
|
|
186
|
+
```bibtex
|
|
187
|
+
@software{inspiros_2024_10449791,
|
|
188
|
+
author = {Hoang-Nhat Tran},
|
|
189
|
+
title = {inspiros/kap: v0.2.1},
|
|
190
|
+
month = jan,
|
|
191
|
+
year = 2024,
|
|
192
|
+
publisher = {Zenodo},
|
|
193
|
+
version = {v0.2.1},
|
|
194
|
+
doi = {10.5281/zenodo.10449791},
|
|
195
|
+
url = {https://doi.org/10.5281/zenodo.10449791}
|
|
196
|
+
}
|
|
197
|
+
```
|
|
198
|
+
|
|
180
199
|
## License
|
|
181
200
|
|
|
182
201
|
MIT licensed. See [LICENSE.txt](LICENSE.txt).
|
|
@@ -24,6 +24,9 @@ classifiers =
|
|
|
24
24
|
Programming Language :: Python :: 3.9
|
|
25
25
|
Programming Language :: Python :: 3.10
|
|
26
26
|
Programming Language :: Python :: 3.11
|
|
27
|
+
Programming Language :: Python :: 3.12
|
|
28
|
+
Programming Language :: Python :: 3.13
|
|
29
|
+
Programming Language :: Python :: 3.14
|
|
27
30
|
Operating System :: OS Independent
|
|
28
31
|
Topic :: Scientific/Engineering :: Mathematics
|
|
29
32
|
keywords = k-assignment, k-partite-matching, linear-assignment, bi-partite-matching, hungarian
|
kap-0.2.1/kap/_version.py
DELETED
|
@@ -1 +0,0 @@
|
|
|
1
|
-
__version__ = '0.2.1'
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
|
File without changes
|
{kap-0.2.1 → kap-0.2.2}/setup.py
RENAMED
|
File without changes
|