DILWORTH-LABELING

Direct Acyclic Graphs (DAG) labeling with Dilworth's theorem and Bogart-Magagnosc's algorithm

PREREQUISITES

• Python 2.7
• pip

INSTALL REQUIREMENTS

pip install -r requirements.txt

TEST

python test.py <number of nodes> <edges creation probability (0,1]>

EXAMPLE

DAG with 8 vertices labeled with 3 identifiers (one per chain).