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$?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top