Python implementation of a doubly connected edge list
Switch branches/tags
Nothing to show
Clone or download
anglyan Merge pull request #1 from gxyd/remove_whitespace
Removed some of the whitespace
Latest commit e1d5ac2 Apr 2, 2017
Permalink
Failed to load latest commit information.
dcel Removed some of the whitespace Apr 1, 2017
.gitignore Short description of dcel added to README.rst Jul 27, 2015
LICENSE.txt
MANIFEST.in first commit Jul 27, 2015
README.rst Short description of dcel added to README.rst Jul 27, 2015
setup.py first commit Jul 27, 2015

README.rst

dcel

dcel is a Python implementation of a doubly-connected edge list, a data structure that represents a planar graph in the plane, providing a simple way of extracting topological information such as vertices, edges and faces.