How to build a directed graph with a given number of nodes N so that for every pair of nodes there is a path of size < L. I'd like also to minimize the number of edges.
How to build a directed graph with paths shorter than a given size?
Viewed 61
0 Answers
Related