@evan So what you've got is a sort of directed graph with colored edges, where there are many nodes and each node can "see" N other nodes. There are at least 3 categorizable types of "sight", and if node A can "see" node B the reverse is not necessarily true. If we want to talk about "the part of the graph that can all mutually see each other" then graph theory offers us a variety of vocabulary for talking about that. "connected component" & "clique" are good starting points w/wikipedia entries.
https://mastodon.social/@mcc/113595693735746831
No replies.
────
────