все листья имеют тип 0

for type=0...n-1
	for v такого type
		int P = p[v]
		list[P].push_back(type)
		if (list[P].size() == deg[P]) {
			// бор на хеш-таблицах
			type[P] = getType(list[P])
			all[type[P]].push_back(P)
		}

// ~2011
for type=0...n-1
	for P такого type
		if edgeChar[P] != type
			edgeChar[P] = type
			next[P] = k++
		vertex[P] = next[P]
		// vertex[P] = goDown(vertex[P], type)
		if (++size[P] == deg[P])
			all[vertex[P]].push_back(p[P])