Closed jesselangdon closed 7 years ago
I think we might be able to do this with NetowrkX and cycles:
from wikipedia:
In graph theory, a cycle graph or circular graph is a graph that consists of a single cycle, or in other words, some number of vertices connected in a closed chain. The cycle graph with n vertices is called Cn.
The way I would approach this problem:
Check out the commit above. It demonstrates (I think) how we can identift braids:
The output is:
We also be need to be able to filter out stream segments by attributes.
Check out: https://github.com/SouthForkResearch/pyGNAT/commit/bd6bb3cc792e3086427820e37a69008635f84af3
(Not sure why the original G is printing out with the weird blocky symbols.)
This has been incorporated into network.py
We need to be able to automatically label stream features as "true" braids, vs stream features that form a polygon (for instance, when canals cross a two or more stream channels.)