Cycles in Graphs
So onto the next question...
I would like to isolate any parts of a graph that forms a loop (is this called cycles in graph theory?).
Is there an established workflow for this in topologic?
Sadly we do not support cycles. It is a known limitation in our Graph class. But if you explain more what you want to accomplish, maybe there is a custom workflow we can add to emulate cyclical graphs.
Hmm.. a drawing would help here. I am not sure, but perhaps you can separate the start point and the end point slightly.
I would like to query a graph of an apartment and identify the two "loops" as sub-graphs.
Preferably I would also like to know that the red one inscribes the bathroom without connecting to it.
Am I making sense?