This function creates a graph with vertices numbered from 1 to n for any input `Graph `. The result is in the form of Vec to make implementing other algorithms on the graph easier and help with performance. We expect that all vertices, even the isolated ones, to have an entry in `adj` (possibly an empty vector) */
(adj: &Graph<V>)
source not stored for this graph (policy: none)