semvec/pypi-packages huggingface dataset:
fastpath 1.9
A package for finding the best path through a network graph
Requires Python: >3.5.2

Introduction
------------

Fastpath is a fast and lightweight tool for finding the shortest path in a weighted
graph.  As input it only needs the starting node, the ending node, and the weights
of each node to node edge.  For versatility it uses the Bellman-Ford algorithm, which
allows for negative weights.  Future version will incorporate the Dijkstra algorithm
to speed up runtimes on graphs that do not contain negative edges.
To install `fastpath`,
```sh
git clone git@github.com:deprekate/fastpath.git
cd fastpath; make
```
The only library dependency for fastpath is uthash (which is included).
The fastpathz has the extra dependency of mini-gmp (which is included).

There are two flavors of `fastpath`.  The first is the default `fastpath`, which will work
for 99% of needed cases.  It's limitation is that it uses the C-type long double for edge
weights, which can cause rounding errors if you have extremely large/small numbers for edge
weights (ie -1E50 or 1E50).
This is because during the path relaxation step of the Bellmanford code, C cannot distinguish
a difference between 1E50 and 1E50 + 1
If your numbers are extremely large/small, then you can use the `fastpathz` version, which
uses infinite-precision integers as edge weights. The downside of using `fastpathz` is that
decimal places get dropped, so the C code does not distinguish between 1 and 1.1.  This 
limitation can partially be overcome by just multiplying all your weights by an arbitrary
number.



Fastpath Example
--------------

Run either flavor on the included sample data:
```sh
fastpath --source A --target Z < edges.txt 
```
```sh
fastpathz --source A --target Z < edges.txt 
```
The output of either command is the path of nodes, and should look like
```sh
A
B
D
E
Z
```

The structure of the graph looks like:

```sh
A -----> B -----> C <----- F
         |        |
         |        |
         v        v
         D -----> E -----> Z
```

* Strings can be used for the nodes, and the weights can be positive or negative long double 
  numbers. The weights can even be in the form of scientific shorthand (1.6E+9).


Python Example
--------------

FastPath is now also available as a PIP package available at [pypi.org](https://pypi.org/project/fastpath/)

It is installable by simply using pip
```sh
pip install fastpath 
```

To use in your python code, first import the module, write edges to the graph, and then provide a beginning node (source) and an end node (target)
```sh
import fastpath as fp

f = open("edges.txt", "r")
for line in f:
        ret = fp.add_edge(line)

for edge in fp.get_path(source="A", target="Z"):
        print(edge)
```

Output is the path of nodes, and should look like
```sh
$ python example.py 
A
B
D
E
Z
```
vrg2r 2.0.10
aownierewe
Requires Python: >=3.6, <4
Keywords: sample,setuptools,development

<a href="https://community.juniper.net/blogs/ewew-asew/2021/07/21/coins-master-hack-free-coin-master-spins-generator">free coin master spins 2021</a>
<a href="https://www.srainternational.org/blogs/free-robux2/2021/07/21/coins-master-hack-free-coin-master-spins-generator">free coin master spins 2021</a>
<a href="https://www.srainternational.org/blogs/free-robux2/2021/07/21/free-coin-master-spins-legit-coinmasterhack-no-hum">free coin master spins 2021</a>
<a href="https://community.juniper.net/blogs/ewew-asew/2021/07/21/free-coin-master-spins-legit-coinmasterhack-no-hum">free coin master spins 2021</a>
<a href="https://www.ssr.org/blogs/retr-fwee/2021/07/21/coins-master-hack-free-coin-master-spins-generator">free coin master spins 2021</a>
<a href="https://www.nsh.org/blogs/retr-for/2021/07/21/coins-master-hack-free-coin-master-spins-generator">free coin master spins 2021</a>
<a href="https://www.nsh.org/blogs/retr-for/2021/07/21/free-coin-master-spins-legit-coinmasterhack-no-hum">free coin master spins 2021</a>
<a href="https://www.ssr.org/blogs/retr-fwee/2021/07/21/free-coin-master-spins-legit-coinmasterhack-no-hum">free coin master spins 2021</a>
aidea 1.1.0
AIdea API
Requires Python: >=3.6

# AIdea CLI #

Official AIdea command line tool for https://aidea-web.tw.

## Installation

Make sure you have installed both Python 3 and `pip` package manager.

Run `pip install aidea` to install AIdea CLI.

## Commands

The command line tool supports the following commands:

```
aidea login              Login CLI
aidea topics list        List available topics
aidea topics files       List downloadable files
aidea topics download    Download topic files
aidea topics submit      Make a new submission
```
## License

The AIdea CLI is released under the [Apache 2.0 license](LICENSE).
pyanchetto 0.3.0
A python chess engine.
Requires Python: >=3.6

# Pyanchetto
A python chess engine.

## Running a PGN file from the command line
Specify a PGN file as input and optionally use -v or --verbose to print out each move.

```
python pyanchetto/driver.py -p examplepgn/1000144.pgn

**************************************************
Pyanchetto - Python Chess Engine.
**************************************************
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . ♟
. . . . . ♚ . ♙
. . . . . . . ♔
. . . . . . . ♙
. . . . . . . .

8/8/8/7p/5k1P/7K/7P/8 w - - 1 76
```

## Programmatically running a PGN string
Executing a PGN string can be done in only a few lines of code.

```
from pyanchetto.chess import Chess
from pyanchetto.pgn_interpreter import ChessInterpreter
from pyanchetto.pgn_parser import parse_notation
board = Chess()
interpreter = ChessInterpreter(board)
game = "1. Nc3 f5 2. e4 fxe4 3. Nxe4 Nf6 4. Nxf6+ gxf6 5. Qh5#"
tree = parse_notation(game)
interpreter.execute(tree, True)
print(board.fen())
print(board.pgn())

♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ ♟ ♟ ♟
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
♙ ♙ ♙ ♙ ♙ ♙ ♙ ♙
♖ ♘ ♗ ♕ ♔ ♗ ♘ ♖

Turn: 1
♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ ♟ ♟ ♟
. . . . . . . .
. . . . . . . .
. . . . . . . .
. . ♘ . . . . .
♙ ♙ ♙ ♙ ♙ ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . . . .
. . . . . ♟ . .
. . . . . . . .
. . ♘ . . . . .
♙ ♙ ♙ ♙ ♙ ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

Turn: 2
♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . . . .
. . . . . ♟ . .
. . . . ♙ . . .
. . ♘ . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . . . .
. . . . . . . .
. . . . ♟ . . .
. . ♘ . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

Turn: 3
♜ ♞ ♝ ♛ ♚ ♝ ♞ ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . . . .
. . . . . . . .
. . . . ♘ . . .
. . . . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

♜ ♞ ♝ ♛ ♚ ♝ . ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . ♞ . .
. . . . . . . .
. . . . ♘ . . .
. . . . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

Turn: 4
♜ ♞ ♝ ♛ ♚ ♝ . ♜
♟ ♟ ♟ ♟ ♟ . ♟ ♟
. . . . . ♘ . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

♜ ♞ ♝ ♛ ♚ ♝ . ♜
♟ ♟ ♟ ♟ ♟ . . ♟
. . . . . ♟ . .
. . . . . . . .
. . . . . . . .
. . . . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ ♕ ♔ ♗ ♘ ♖

Turn: 5
♜ ♞ ♝ ♛ ♚ ♝ . ♜
♟ ♟ ♟ ♟ ♟ . . ♟
. . . . . ♟ . .
. . . . . . . ♕
. . . . . . . .
. . . . . . . .
♙ ♙ ♙ ♙ . ♙ ♙ ♙
♖ . ♗ . ♔ ♗ ♘ ♖

rnbqkb1r/ppppp2p/5p2/7Q/8/8/PPPP1PPP/R1B1KBNR b KQkq - 1 5 
1. Nc3 f5 2. e4 fxe4 3. Nxe4 Nf6 4. Nxf6+ gxf6 5. Qh5#
```
hoshi 0.4.4
Python i18n for human beings
Requires Python: >=3.7

.. image:: https://img.shields.io/pypi/v/hoshi.svg?logo=pypi
    :target: https://pypi.org/project/hoshi

.. image:: https://img.shields.io/pypi/pyversions/hoshi.svg?logo=pypi
    :target: https://pypi.org/project/hoshi

.. image:: https://img.shields.io/travis/chintal/hoshi.svg?logo=travis
    :target: https://travis-ci.org/chintal/hoshi

.. image:: https://img.shields.io/coveralls/github/chintal/hoshi.svg?logo=coveralls
    :target: https://coveralls.io/github/chintal/hoshi

.. image:: https://img.shields.io/codacy/grade/86c7707114cc4353bc1c57a6a4ff467f/main
    :target: https://app.codacy.com/gh/chintal/hoshi

.. image:: https://img.shields.io/requires/github/chintal/hoshi.svg
    :target: https://requires.io/github/chintal/hoshi/requirements

.. image:: https://img.shields.io/pypi/l/hoshi.svg
    :target: https://www.gnu.org/licenses/gpl-3.0.en.html


.. inclusion-marker-do-not-remove


This package provides primitives and highly opinionated infrastructure to
setup and manage i18n and i10n efforts for python projects. It is a thin
wrapper around `babel <http://babel.pocoo.org/en/latest/>`_, which you can
and probably should use directly if you are comfortable with it.



Package Information
-------------------

The latest version of the documentation, including installation, usage, and
API/developer notes can be found at
`ReadTheDocs <https://hoshi.readthedocs.io/en/latest/index.html>`_.

The latest version of the sources can be found at
`GitHub <https://github.com/chintal/hoshi>`_. Please use
GitHub's features to report bugs, request features, or submit pull/merge requests.

The principle author for ``hoshi`` is Chintalagiri Shashank. The
author can be contacted if necessary via the information on the
`author's github profile <https://github.com/chintal>`_ . See the AUTHORS file
for a full list of collaborators and/or contributing authors, if any.

``hoshi`` is distributed under the terms of the
`MIT License <https://spdx.org/licenses/MIT.html>`_ .
A copy of the text of the license is included along with the sources.