Function breadth_first_search

src/utils/graph.cpp:162–188

}

std::vector<El::Int>
breadth_first_search(El::Int root,
                     const std::map<El::Int, std::set<El::Int>>& edges)
{

  // Initialize data structures
  std::unordered_map<El::Int, bool> is_visited;
  std::vector<El::Int> sorted_nodes;
  std::queue<El::Int> search_queue;
  search_queue.push(root);

  // Visit nodes until search queue is exhausted
  while (!search_queue.empty()) {
    const auto& node = search_queue.front();
    search_queue.pop();
    for (const auto& neighbor : get_neighbors(node, edges)) {
      if (!is_visited[neighbor]) {
        is_visited[neighbor] = true;
        sorted_nodes.push_back(neighbor);
        search_queue.push(neighbor);
      }
    }
  }

  // Return list of sorted nodes
  return sorted_nodes;
}

std::vector<El::Int>
depth_first_search(El::Int root,