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.