Stream edgelist

[funsooje]

Stream a simple edge list with no annotations

[tonythomascn]

Please add Doxygen style function comments to your new functions like this on in brandes algorithm:
/**

• Parallel approximate betweenness centrality using Brandes algorithm @verbatim embed:rst:inline :cite:brandes_bc.@endverbatim
• Rather than using all vertices in the graph to compute paths, the algorithm uses a
• specified set of root nodes. Parallelization is effected through C++ standard library
• execution policies.
• @tparam Graph Type of the graph. Must meet requirements of adjacency_list_graph concept.
• @tparam score_t Type of the centrality scores computed for each vertex.
• @tparam accum_t Type of path counts.
• @tparam OuterExecutionPolicy Parallel execution policy type for outer loop of algorithm. Default: std::execution::parallel_unsequenced_policy
• @tparam InnerExecutionPolicy Parallel execution policy type for inner loop of algorithm. Default: std::execution::parallel_unsequenced_policy
• @param G Input graph.
• @param normalize Flag indicating whether to normalize centrality scores relative to largest score.
• @param sources Vector of starting sources.
• @param outer_policy Outer loop parallel execution policy.
• @param inner_policy Inner loop parallel execution policy.
• @param threads Number of threads being used in computation. Used to compute number of bins in computation.
• @return Vector of centrality for each vertex.
  */