Graphs.jl functions that need to be wrapped

[mtfishman]

• bellman_ford_shortest_paths
• betweenness_centrality
• boruvka_mst (Add more wrappers for Graphs.jl functions #17)
• center (Add mincut and related functions #20)
• closeness_centrality
• connected_components (Add connected_components, merge_vertices. Fix incident_edges. #19)
• degree_centrality
• desopo_pape_shortest_paths
• diameter (Add mincut and related functions #20)
• dijkstra_shortest_paths (Add mincut and related functions #20)
• eccentricity (Add mincut and related functions #20)
• floyd_warshall_shortest_paths
• gdistances
• GraphFlows.jl
• is_connected (Add more wrappers for Graphs.jl functions #17)
• is_cyclic (Add more wrappers for Graphs.jl functions #17)
• johnson_shortest_paths
• merge_vertices (Add connected_components, merge_vertices. Fix incident_edges. #19)
• merge_vertices!
• mincut (Add connected_components, merge_vertices. Fix incident_edges. #19)
• GraphFlows.mincut (Add mincut and related functions #20)
• kruskal_mst (Add more wrappers for Graphs.jl functions #17)
• periphery (Add mincut and related functions #20)
• prim_mst (Add more wrappers for Graphs.jl functions #17)
• radius (Add mincut and related functions #20)
• spfa_shortest_paths (Should Graphs.jl algorithms automatically work on a NamedDimGraph? #12) (Add more wrappers for Graphs.jl functions #17)
• steiner_tree (Add mincut and related functions #20)
• topological_sort_by_dfs (Add mincut and related functions #20)
• yen_k_shortest_paths