Skip to main content

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

  1. Install package using pip by running pip3 install ..

  2. 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


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)

Uploaded Source

Built Distribution

poly_classifier-0.0.1-py3-none-any.whl (6.2 kB view hashes)

Uploaded Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page