Turns out we were getting lucky on the order of nodes in each edge and the order of nodes over all because of Python 3.6 implementation of dictionaries. Using OrderedDict and OrdereredGraph makes things much more compatible.
Coverage remained the same at 96.364% when pulling 0584d49967b68f432b31990ef9a3bd48efd79cd5 on support-py-2dot7 into 42097ba700b02aa2729e4d27ac206dcd2f2488db on master.
Coverage remained the same at 96.364% when pulling 0c73dc21ac2f8003f83e2945d98cc1bd1d82e3d0 on support-py-2dot7 into 42097ba700b02aa2729e4d27ac206dcd2f2488db on master.
Coverage remained the same at 96.364% when pulling 04a7e94a301f020a0af6b37ecdf7a6bbfb6ec3e7 on support-py-2dot7 into 42097ba700b02aa2729e4d27ac206dcd2f2488db on master.
Coverage remained the same at 96.364% when pulling 56fec1c62453805118fd202bff0ff589d9455f9e on support-py-2dot7 into 42097ba700b02aa2729e4d27ac206dcd2f2488db on master.
Turns out we were getting lucky on the order of nodes in each edge and the order of nodes over all because of Python 3.6 implementation of dictionaries. Using OrderedDict and OrdereredGraph makes things much more compatible.
Also uses relative imports for 2.7 support.
Closes #14