|
|
|
|
|
by ww520
2527 days ago
|
|
The "topological" in topological sort is more related to "network topology" than the mathematical topology (open sets). "Sort" is related to ordering. Topological sort thus is related to the ordering of a network graph's nodes by their edges. You can see https://en.wikipedia.org/wiki/Topological_sorting to see what it actually is. Topological sort is good in dealing with dependency graph. It can turn a dependency graph into a linear ordering of nodes. GP mentioned topological sort because words depend on other defining words and it's one big directed acyclic graph. Do a topological sort on it and you got a linear list of words ordered by dependency. Group the consecutive words that have no dependency together and you got the word layers. Within each layer all the words don't depend on each other. The words in one layer depend on the words in the lower layers. |
|
The open sets in a network topology are the subsets of nodes that happen to be connected by the edges. So if you can't get from here to there without using a node outside your set, then your set isn't an open set in the network topology.