My professor uses the term "clean graph" to mean that the nodes have no idea of the topology. Each node is aware of its ID, but has no idea about parents or edges and so on and it has to discover.
Is this terminology a thing? Because I find no evidence in the internet. Is there another term for the same thing?