heapgeneratorq 0.1.0__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.
- heapgeneratorq-0.1.0/LICENSE +21 -0
- heapgeneratorq-0.1.0/MANIFEST.in +3 -0
- heapgeneratorq-0.1.0/PKG-INFO +99 -0
- heapgeneratorq-0.1.0/README.md +69 -0
- heapgeneratorq-0.1.0/heapgeneratorq/__init__.py +32 -0
- heapgeneratorq-0.1.0/heapgeneratorq/l1.py +1891 -0
- heapgeneratorq-0.1.0/heapgeneratorq.egg-info/PKG-INFO +99 -0
- heapgeneratorq-0.1.0/heapgeneratorq.egg-info/SOURCES.txt +11 -0
- heapgeneratorq-0.1.0/heapgeneratorq.egg-info/dependency_links.txt +1 -0
- heapgeneratorq-0.1.0/heapgeneratorq.egg-info/top_level.txt +1 -0
- heapgeneratorq-0.1.0/pyproject.toml +32 -0
- heapgeneratorq-0.1.0/setup.cfg +4 -0
- heapgeneratorq-0.1.0/setup.py +36 -0
|
@@ -0,0 +1,21 @@
|
|
|
1
|
+
MIT License
|
|
2
|
+
|
|
3
|
+
Copyright (c) 2025 Devank U
|
|
4
|
+
|
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
|
7
|
+
in the Software without restriction, including without limitation the rights
|
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
|
10
|
+
furnished to do so, subject to the following conditions:
|
|
11
|
+
|
|
12
|
+
The above copyright notice and this permission notice shall be included in all
|
|
13
|
+
copies or substantial portions of the Software.
|
|
14
|
+
|
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
21
|
+
SOFTWARE.
|
|
@@ -0,0 +1,99 @@
|
|
|
1
|
+
Metadata-Version: 2.4
|
|
2
|
+
Name: heapgeneratorq
|
|
3
|
+
Version: 0.1.0
|
|
4
|
+
Summary: A comprehensive collection of algorithms and data structures implementations
|
|
5
|
+
Home-page: https://github.com/DevankU/heapgeneratorq
|
|
6
|
+
Author: Devank U
|
|
7
|
+
Author-email: Devank U <devank@example.com>
|
|
8
|
+
License: MIT
|
|
9
|
+
Project-URL: Homepage, https://github.com/DevankU/heapgeneratorq
|
|
10
|
+
Project-URL: Bug Tracker, https://github.com/DevankU/heapgeneratorq/issues
|
|
11
|
+
Classifier: Development Status :: 3 - Alpha
|
|
12
|
+
Classifier: Intended Audience :: Developers
|
|
13
|
+
Classifier: Intended Audience :: Education
|
|
14
|
+
Classifier: Topic :: Software Development :: Libraries :: Python Modules
|
|
15
|
+
Classifier: Topic :: Education
|
|
16
|
+
Classifier: License :: OSI Approved :: MIT License
|
|
17
|
+
Classifier: Programming Language :: Python :: 3
|
|
18
|
+
Classifier: Programming Language :: Python :: 3.7
|
|
19
|
+
Classifier: Programming Language :: Python :: 3.8
|
|
20
|
+
Classifier: Programming Language :: Python :: 3.9
|
|
21
|
+
Classifier: Programming Language :: Python :: 3.10
|
|
22
|
+
Classifier: Programming Language :: Python :: 3.11
|
|
23
|
+
Requires-Python: >=3.7
|
|
24
|
+
Description-Content-Type: text/markdown
|
|
25
|
+
License-File: LICENSE
|
|
26
|
+
Dynamic: author
|
|
27
|
+
Dynamic: home-page
|
|
28
|
+
Dynamic: license-file
|
|
29
|
+
Dynamic: requires-python
|
|
30
|
+
|
|
31
|
+
# heapgeneratorq
|
|
32
|
+
|
|
33
|
+
A comprehensive Python package containing implementations of various algorithms and data structures for educational purposes.
|
|
34
|
+
|
|
35
|
+
## Features
|
|
36
|
+
|
|
37
|
+
This package includes implementations of:
|
|
38
|
+
|
|
39
|
+
- **LAB 1 - Searching Algorithms**: Linear and Binary Search with Student Record System
|
|
40
|
+
- **LAB 2 - Sorting Algorithms**: Quick Sort and Merge Sort with Transaction Management
|
|
41
|
+
- **LAB 3 - Graph Algorithms**: Prim's and Kruskal's Minimum Spanning Tree
|
|
42
|
+
- **LAB 4 - Shortest Path**: Dijkstra's Algorithm for Delivery Network
|
|
43
|
+
- **LAB 5 - Dynamic Programming**: 0/1 Knapsack Problem Solver
|
|
44
|
+
- **LAB 6 - All-Pairs Shortest Path**: Floyd-Warshall Algorithm
|
|
45
|
+
- **LAB 7 - Combinatorics**: Magic Square Generator (Odd, Doubly Even, Singly Even)
|
|
46
|
+
- **LAB 8 - Backtracking**: N-Queens Problem Solver
|
|
47
|
+
|
|
48
|
+
## Installation
|
|
49
|
+
|
|
50
|
+
Install the package using pip:
|
|
51
|
+
|
|
52
|
+
```bash
|
|
53
|
+
pip install heapgeneratorq
|
|
54
|
+
```
|
|
55
|
+
|
|
56
|
+
## Usage
|
|
57
|
+
|
|
58
|
+
After installation, you can access the algorithms file:
|
|
59
|
+
|
|
60
|
+
```python
|
|
61
|
+
import heapgeneratorq
|
|
62
|
+
import os
|
|
63
|
+
|
|
64
|
+
# Get the path to the algorithms file
|
|
65
|
+
algorithms_file = os.path.join(os.path.dirname(heapgeneratorq.__file__), 'l1.py')
|
|
66
|
+
print(f"Algorithms file located at: {algorithms_file}")
|
|
67
|
+
|
|
68
|
+
# You can also copy it to your current directory
|
|
69
|
+
import shutil
|
|
70
|
+
shutil.copy(algorithms_file, 'l1.py')
|
|
71
|
+
```
|
|
72
|
+
|
|
73
|
+
Or run it directly:
|
|
74
|
+
|
|
75
|
+
```bash
|
|
76
|
+
python -m heapgeneratorq.l1
|
|
77
|
+
```
|
|
78
|
+
|
|
79
|
+
## Requirements
|
|
80
|
+
|
|
81
|
+
- Python 3.7 or higher
|
|
82
|
+
|
|
83
|
+
## License
|
|
84
|
+
|
|
85
|
+
MIT License
|
|
86
|
+
|
|
87
|
+
## Contributing
|
|
88
|
+
|
|
89
|
+
Contributions are welcome! Please feel free to submit a Pull Request.
|
|
90
|
+
|
|
91
|
+
## Author
|
|
92
|
+
|
|
93
|
+
Your Name
|
|
94
|
+
|
|
95
|
+
## Changelog
|
|
96
|
+
|
|
97
|
+
### 0.1.0 (2025-11-03)
|
|
98
|
+
- Initial release
|
|
99
|
+
- Includes comprehensive algorithm implementations
|
|
@@ -0,0 +1,69 @@
|
|
|
1
|
+
# heapgeneratorq
|
|
2
|
+
|
|
3
|
+
A comprehensive Python package containing implementations of various algorithms and data structures for educational purposes.
|
|
4
|
+
|
|
5
|
+
## Features
|
|
6
|
+
|
|
7
|
+
This package includes implementations of:
|
|
8
|
+
|
|
9
|
+
- **LAB 1 - Searching Algorithms**: Linear and Binary Search with Student Record System
|
|
10
|
+
- **LAB 2 - Sorting Algorithms**: Quick Sort and Merge Sort with Transaction Management
|
|
11
|
+
- **LAB 3 - Graph Algorithms**: Prim's and Kruskal's Minimum Spanning Tree
|
|
12
|
+
- **LAB 4 - Shortest Path**: Dijkstra's Algorithm for Delivery Network
|
|
13
|
+
- **LAB 5 - Dynamic Programming**: 0/1 Knapsack Problem Solver
|
|
14
|
+
- **LAB 6 - All-Pairs Shortest Path**: Floyd-Warshall Algorithm
|
|
15
|
+
- **LAB 7 - Combinatorics**: Magic Square Generator (Odd, Doubly Even, Singly Even)
|
|
16
|
+
- **LAB 8 - Backtracking**: N-Queens Problem Solver
|
|
17
|
+
|
|
18
|
+
## Installation
|
|
19
|
+
|
|
20
|
+
Install the package using pip:
|
|
21
|
+
|
|
22
|
+
```bash
|
|
23
|
+
pip install heapgeneratorq
|
|
24
|
+
```
|
|
25
|
+
|
|
26
|
+
## Usage
|
|
27
|
+
|
|
28
|
+
After installation, you can access the algorithms file:
|
|
29
|
+
|
|
30
|
+
```python
|
|
31
|
+
import heapgeneratorq
|
|
32
|
+
import os
|
|
33
|
+
|
|
34
|
+
# Get the path to the algorithms file
|
|
35
|
+
algorithms_file = os.path.join(os.path.dirname(heapgeneratorq.__file__), 'l1.py')
|
|
36
|
+
print(f"Algorithms file located at: {algorithms_file}")
|
|
37
|
+
|
|
38
|
+
# You can also copy it to your current directory
|
|
39
|
+
import shutil
|
|
40
|
+
shutil.copy(algorithms_file, 'l1.py')
|
|
41
|
+
```
|
|
42
|
+
|
|
43
|
+
Or run it directly:
|
|
44
|
+
|
|
45
|
+
```bash
|
|
46
|
+
python -m heapgeneratorq.l1
|
|
47
|
+
```
|
|
48
|
+
|
|
49
|
+
## Requirements
|
|
50
|
+
|
|
51
|
+
- Python 3.7 or higher
|
|
52
|
+
|
|
53
|
+
## License
|
|
54
|
+
|
|
55
|
+
MIT License
|
|
56
|
+
|
|
57
|
+
## Contributing
|
|
58
|
+
|
|
59
|
+
Contributions are welcome! Please feel free to submit a Pull Request.
|
|
60
|
+
|
|
61
|
+
## Author
|
|
62
|
+
|
|
63
|
+
Your Name
|
|
64
|
+
|
|
65
|
+
## Changelog
|
|
66
|
+
|
|
67
|
+
### 0.1.0 (2025-11-03)
|
|
68
|
+
- Initial release
|
|
69
|
+
- Includes comprehensive algorithm implementations
|
|
@@ -0,0 +1,32 @@
|
|
|
1
|
+
"""
|
|
2
|
+
heapgeneratorq - A comprehensive collection of algorithms and data structures
|
|
3
|
+
"""
|
|
4
|
+
|
|
5
|
+
__version__ = "0.1.0"
|
|
6
|
+
__author__ = "Devank U"
|
|
7
|
+
__email__ = "devank@example.com"
|
|
8
|
+
|
|
9
|
+
# Make the package contents easily accessible
|
|
10
|
+
import os
|
|
11
|
+
|
|
12
|
+
def get_algorithms_file_path():
|
|
13
|
+
"""Returns the path to the l1.py algorithms file"""
|
|
14
|
+
return os.path.join(os.path.dirname(__file__), 'l1.py')
|
|
15
|
+
|
|
16
|
+
def copy_algorithms_file(destination='.'):
|
|
17
|
+
"""
|
|
18
|
+
Copy the l1.py algorithms file to a specified destination
|
|
19
|
+
|
|
20
|
+
Args:
|
|
21
|
+
destination (str): Directory where the file should be copied (default: current directory)
|
|
22
|
+
|
|
23
|
+
Returns:
|
|
24
|
+
str: Path to the copied file
|
|
25
|
+
"""
|
|
26
|
+
import shutil
|
|
27
|
+
source = get_algorithms_file_path()
|
|
28
|
+
dest_path = os.path.join(destination, 'l1.py')
|
|
29
|
+
shutil.copy(source, dest_path)
|
|
30
|
+
return dest_path
|
|
31
|
+
|
|
32
|
+
__all__ = ['get_algorithms_file_path', 'copy_algorithms_file']
|