A command-line tool for automatically classifying LCL problems on regular trees in the polynomial region.
Project description
Description
This folder contains a program that decides round complexity of homogenous LCL problems on (binary) trees in the polynomial region.
Usage
-
Install package using pip by running
pip3 install .
. -
Run
python -m poly_classifier
and describe (on standard input) configurations of a problem. For example:
Note that one needs to first run the classifier (python -m poly_classifier
) and only afterwards provide an input
on a separate lines.
> python -m poly_classifier
Polynomial classifier for homogenous trees (currently for binary rooted & unrooted trees)
For unrooted case, use node configuration in form: 'A B C' and edge configurations in form 'A B'
For rooted case, use only node configurations in form 'A: B C'.
Node configurations: (each configuration on a new line and end with empty line)
a a a
b b b
Edge configurations: (each configuration on a new line and end with empty line)
a b
Complexity of the problem is Θ(n^(1/1)).
Tests
To execute tests, run the following from the root directory:
python -m unittest discover
Project details
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 Distribution
poly-classifier-0.0.1.tar.gz
(4.8 kB
view hashes)
Built Distribution
Close
Hashes for poly_classifier-0.0.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | c4468ad658dee383f50ed8af4da0ddab8d61f642bfc9384feeda0f835f21cc12 |
|
MD5 | c4f5545791638947b5c08ac3857bffc9 |
|
BLAKE2b-256 | 1d2219e07771ae77de719a0cbd997e1f828e20dd5c086fc33208f8fc5d42a2a7 |