There might be some kind of operation you could define that does a sort of local reorganization on a graph (under certain conditions) that’s similar to how red-black trees are balanced. Consider the two versions of CGTF from 2025-10-19 and 2025-10-22 on Miro. On the second, the important information is kept clearer while the supporting details were reorganized as warrants which sort of puts them off to the side. If you could formalize this conversion process, you might have a way to keep the graph only showing important nodes without having to do any kind of collapse of node chains.
Original structure (2025-10-19)
Alternative structure (2025-10-22)
