* \brief Populate the adjacency list for each vertex in the graph. * Assumes that evey edge is a pair of valid vertex indices. * * @param N number of vertices in the graph * @param undirected_edges list of graph's undirected edges */
source not stored for this graph (policy: none)