Skip to main content
This is a pre-production deployment of Warehouse. Changes made here affect the production instance of PyPI (pypi.python.org).
Help us improve Python packaging - Donate today!

Directed Acyclic Word Graph (DAWG) allows to store huge strings set in compacted form

Project Description

pyDAWG implements DAWG structure. Testing if word is present in a set has complexity O(n), where n is length of tested string.

Algorithm used to build DAWG is incremental, memory overhead during graph construction is small.

Module supports also minimal perfect hashing — it is possible to get unique number for any word from a set, or find which word has assigned given number. This makes possible to use DAWG as a dictionary.

The module has been written in C. There is also a pure python version providing most of C version functionality.

Release History

Release History

This version
History Node

1.1

History Node

1.0.0

Supported By

WebFaction WebFaction Technical Writing Elastic Elastic Search Pingdom Pingdom Monitoring Dyn Dyn DNS Sentry Sentry Error Logging CloudAMQP CloudAMQP RabbitMQ Heroku Heroku PaaS Kabu Creative Kabu Creative UX & Design Fastly Fastly CDN DigiCert DigiCert EV Certificate Rackspace Rackspace Cloud Servers DreamHost DreamHost Log Hosting