My package description
Project description
Best first search, using pre-sorted iterators
It finds the minimum cost path on a graph, where the cost of a path is linear sum of each edge's weight in it. To call the function, the followings are required:
- termination condition
- neighbor iterator; pre sorting the iterator helps the performance so that it iterates through each neighbor in ascending order of cost.
- cost addition function; in case you want to inject relaxation
For usage, take a look at best_first_search.example.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distributions
No source distribution files available for this release.See tutorial on generating distribution archives.
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file best_first_search-0.0.2-py3-none-any.whl.
File metadata
- Download URL: best_first_search-0.0.2-py3-none-any.whl
- Upload date:
- Size: 7.7 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/4.0.1 CPython/3.8.13
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
9cd7fe913649599425d9cc179c564a761907e196a072cfcd5029149ff716dea3
|
|
| MD5 |
d1e9d88558b053227783bf83beb8ecb7
|
|
| BLAKE2b-256 |
b9e9b3308cdc4a7e53d55f649e1deebb6513ba5ccc885a67157c2b05f0be5f1a
|
