skip to navigation
skip to content

Not Logged In

py_sdag2 1.0

Simple Directed Acyclic Graph whith Cicle Detector and TopoloGical sorter utilities.

# Py_SDAG2 - Python Simple Directed Acyclic Graph

The Python Simple Directed Graph whith Cicle Detector and TopoloGical sorter utilities.

## Authors
- [Moises P. Sena](http://moisespsena.com)

## Install

```bash
sudo pip install py_sdag2
```

## Scripts

### tsort.py

Sources from Standard Input:

```bash
echo -e 'C A\nA B\nB D\nC D' | tsort.py
```

Sources from another file:

```bash
echo -e 'C A\nA B\nB D\nC D' > verticies.txt
```

```bash
tsort.py verticies.txt
```

More Options:

```bash
tsort.py --help
Usage: tsort.py [options] [FILE [OUT_FILE]]

Options:
  -h, --help            show this help message and exit
  -f FILE, --file=FILE  With no FILE, or when FILE is -, read standard input.
  -o OUT_FILE, --out-file=OUT_FILE
                        Write result to OUT_FILE, default is standard output.
  -s SEP, --separator=SEP
                        Items separator, default is \s regex.
  -q QUIT_SEQ, --quit-sequence=QUIT_SEQ
                        Stop read FILE where line equals QUIT_SEQ, default is
                        :quit.
```

## Tests

```python
import unittest
from sdag2 import DAG, CycleDetectedException

class DAGTest(unittest.TestCase):
    def test_simple(self):
        '''
        Tests the verticles order in:

        C --> A --> B --> D
        '''

        dag = DAG()
        a = dag.add("A")
        b = dag.add("B")
        c = dag.add("C")
        d = dag.add("D")

        dag.add_edge(c, a)
        dag.add_edge(a, b)
        dag.add_edge(b, d)
        dag.add_edge(c, d)

        rs = dag.topologicaly()

        self.assertTrue(rs.index("C") < rs.index("A"))
        self.assertTrue(rs.index("A") < rs.index("B"))
        self.assertTrue(rs.index("B") < rs.index("D"))
        self.assertTrue(rs.index("C") < rs.index("D"))

    def test_cicle_detect(self):
        '''
        Tests the verticles order in:

        C --> A --> B --> D -> C
        '''

        dag = DAG()
        a = dag.add("A")
        b = dag.add("B")
        c = dag.add("C")
        d = dag.add("D")

        dag.add_edge(c, a)
        dag.add_edge(a, b)
        dag.add_edge(b, d)
        dag.add_edge(c, d)

        try:
            # add cicle at A --> C --> A
            dag.add_edge(a, c)
            raise Exception("Cycle not detected")
        except CycleDetectedException: pass

def main():
    unittest.main()

if __name__ == "__main__":
    main()
```
 
File Type Py Version Uploaded on Size
py_sdag2-1.0-py2.7.egg (md5) Python Egg 2.7 2012-10-08 9KB
py_sdag2-1.0-py3.2.egg (md5) Python Egg 3.2 2012-10-08 9KB
py_sdag2-1.0.tar.gz (md5) Source 2012-10-08 5KB
  • Downloads (All Versions):
  • 1 downloads in the last day
  • 62 downloads in the last week
  • 428 downloads in the last month