# Order the nodes of a directed graph

Given a directed graph $G$ and a number $k$, how can I order the nodes (let's say in an array) so that the distance between each two connected nodes is less than or equal to $k$?

-
That's an NP-complete problem, even for the undirected case, called Bandwidth. – Yuval Filmus Nov 21 '11 at 21:31