|
| 1 | +def get_info(): |
| 2 | +return { |
| 3 | +"backend_name": "graphblas", |
| 4 | +"project": "graphblas-algorithms", |
| 5 | +"package": "graphblas_algorithms", |
| 6 | +"url": "https://.com/python-graphblas/graphblas-algorithms", |
| 7 | +"short_summary": "Fast, OpenMP-enabled backend using GraphBLAS", |
| 8 | +# "description": "TODO", |
| 9 | +"functions": { |
| 10 | +"adjacency_matrix": {}, |
| 11 | +"all_pairs_bellman_ford_path_length": { |
| 12 | +"extra_parameters": { |
| 13 | +"chunksize": "Split the computation into chunks; " |
| 14 | +'may specify size as string or number of rows. Default "10 MiB"', |
| 15 | +}, |
| 16 | +}, |
| 17 | +"all_pairs_shortest_path_length": { |
| 18 | +"extra_parameters": { |
| 19 | +"chunksize": "Split the computation into chunks; " |
| 20 | +'may specify size as string or number of rows. Default "10 MiB"', |
| 21 | +}, |
| 22 | +}, |
| 23 | +"ancestors": {}, |
| 24 | +"average_clustering": {}, |
| 25 | +"bellman_ford_path": {}, |
| 26 | +"bellman_ford_path_length": {}, |
| 27 | +"bethe_hessian_matrix": {}, |
| 28 | +"bfs_layers": {}, |
| 29 | +"boundary_expansion": {}, |
| 30 | +"clustering": {}, |
| 31 | +"complement": {}, |
| 32 | +"compose": {}, |
| 33 | +"conductance": {}, |
| 34 | +"cut_size": {}, |
| 35 | +"degree_centrality": {}, |
| 36 | +"descendants": {}, |
| 37 | +"descendants_at_distance": {}, |
| 38 | +"difference": {}, |
| 39 | +"directed_modularity_matrix": {}, |
| 40 | +"disjoint_union": {}, |
| 41 | +"edge_boundary": {}, |
| 42 | +"edge_expansion": {}, |
| 43 | +"efficiency": {}, |
| 44 | +"ego_graph": {}, |
| 45 | +"eigenvector_centrality": {}, |
| 46 | +"fast_could_be_isomorphic": {}, |
| 47 | +"faster_could_be_isomorphic": {}, |
| 48 | +"floyd_warshall": {}, |
| 49 | +"floyd_warshall_numpy": {}, |
| 50 | +"floyd_warshall_predecessor_and_distance": {}, |
| 51 | +"full_join": {}, |
| 52 | +"generalized_degree": {}, |
| 53 | +"google_matrix": {}, |
| 54 | +"has_path": {}, |
| 55 | +"hits": {}, |
| 56 | +"in_degree_centrality": {}, |
| 57 | +"inter_community_edges": {}, |
| 58 | +"intersection": {}, |
| 59 | +"intra_community_edges": {}, |
| 60 | +"is_connected": {}, |
| 61 | +"is_dominating_set": {}, |
| 62 | +"is_isolate": {}, |
| 63 | +"is_k_regular": {}, |
| 64 | +"isolates": {}, |
| 65 | +"is_regular": {}, |
| 66 | +"is_simple_path": {}, |
| 67 | +"is_tournament": {}, |
| 68 | +"is_triad": {}, |
| 69 | +"is_weakly_connected": {}, |
| 70 | +"katz_centrality": {}, |
| 71 | +"k_truss": {}, |
| 72 | +"laplacian_matrix": {}, |
| 73 | +"lowest_common_ancestor": {}, |
| 74 | +"mixing_expansion": {}, |
| 75 | +"modularity_matrix": {}, |
| 76 | +"mutual_weight": {}, |
| 77 | +"negative_edge_cycle": {}, |
| 78 | +"node_boundary": {}, |
| 79 | +"node_connected_component": {}, |
| 80 | +"node_expansion": {}, |
| 81 | +"normalized_cut_size": {}, |
| 82 | +"normalized_laplacian_matrix": {}, |
| 83 | +"number_of_isolates": {}, |
| 84 | +"out_degree_centrality": {}, |
| 85 | +"overall_reciprocity": {}, |
| 86 | +"pagerank": {}, |
| 87 | +"reciprocity": {}, |
| 88 | +"reverse": {}, |
| 89 | +"score_sequence": {}, |
| 90 | +"single_source_bellman_ford_path_length": {}, |
| 91 | +"single_source_shortest_path_length": {}, |
| 92 | +"single_target_shortest_path_length": {}, |
| 93 | +"s_metric": {}, |
| 94 | +"square_clustering": { |
| 95 | +"extra_parameters": { |
| 96 | +"chunksize": "Split the computation into chunks; " |
| 97 | +'may specify size as string or number of rows. Default "256 MiB"', |
| 98 | +}, |
| 99 | +}, |
| 100 | +"symmetric_difference": {}, |
| 101 | +"tournament_matrix": {}, |
| 102 | +"transitivity": {}, |
| 103 | +"triangles": {}, |
| 104 | +"union": {}, |
| 105 | +"volume": {}, |
| 106 | +}, |
| 107 | +} |
0 commit comments