Skip to main content
Ctrl+K

cugraph-docs 25.06.00 documentation

  • Basics
  • nx-cugraph
  • Installation
  • Tutorials
  • Graph Support
    • WholeGraph
    • References
    • Developer Resources
    • API Reference
  • GitHub
  • Twitter
Home
cugraph
cucimcudf-javacudfcugraphcumlcuprojcuspatialcuvscuxfilterdask-cudadask-cudfkvikiolibcudflibcumllibcuprojlibcuspatiallibkvikiolibrmmlibucxxraftrapids-cmakerapidsmpfrmm
stable (25.06)
nightly (25.08)stable (25.06)legacy (25.04)
  • Basics
  • nx-cugraph
  • Installation
  • Tutorials
  • Graph Support
  • WholeGraph
  • References
  • Developer Resources
  • API Reference
  • GitHub
  • Twitter

Section Navigation

Core Graph API Documentation

  • cugraph API Reference
    • Graph Classes
      • cugraph.Graph
      • cugraph.MultiGraph
      • cugraph.Graph.from_cudf_adjlist
      • cugraph.Graph.from_cudf_edgelist
      • cugraph.Graph.from_dask_cudf_edgelist
      • cugraph.Graph.from_pandas_adjacency
      • cugraph.Graph.from_pandas_edgelist
      • cugraph.Graph.from_numpy_array
      • cugraph.Graph.from_numpy_matrix
      • cugraph.Graph.add_internal_vertex_id
      • cugraph.Graph.add_nodes_from
      • cugraph.Graph.clear
      • cugraph.Graph.unrenumber
      • cugraph.symmetrize
      • cugraph.symmetrize_ddf
      • cugraph.symmetrize_df
      • cugraph.from_adjlist
      • cugraph.from_cudf_edgelist
      • cugraph.from_edgelist
      • cugraph.from_numpy_array
      • cugraph.from_numpy_matrix
      • cugraph.from_pandas_adjacency
      • cugraph.from_pandas_edgelist
      • cugraph.to_numpy_array
      • cugraph.to_numpy_matrix
      • cugraph.to_pandas_adjacency
      • cugraph.to_pandas_edgelist
      • cugraph.structure.NumberMap
      • cugraph.structure.NumberMap.from_internal_vertex_id
      • cugraph.structure.NumberMap.to_internal_vertex_id
      • cugraph.structure.NumberMap.add_internal_vertex_id
      • cugraph.structure.NumberMap.compute_vals
      • cugraph.structure.NumberMap.compute_vals_types
      • cugraph.structure.NumberMap.generate_unused_column_name
      • cugraph.structure.NumberMap.renumber
      • cugraph.structure.NumberMap.renumber_and_segment
      • cugraph.structure.NumberMap.set_renumbered_col_names
      • cugraph.structure.NumberMap.unrenumber
      • cugraph.structure.NumberMap.vertex_column_size
      • cugraph.hypergraph
    • Graph Implementation
      • cugraph.structure.graph_implementation.simpleGraphImpl.view_edge_list
      • cugraph.structure.graph_implementation.simpleGraphImpl.delete_edge_list
      • cugraph.structure.graph_implementation.simpleGraphImpl.view_adj_list
      • cugraph.structure.graph_implementation.simpleGraphImpl.view_transposed_adj_list
      • cugraph.structure.graph_implementation.simpleGraphImpl.delete_adj_list
      • cugraph.structure.graph_implementation.simpleGraphImpl.enable_batch
      • cugraph.structure.graph_implementation.simpleGraphImpl.get_two_hop_neighbors
      • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_vertices
      • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_nodes
      • cugraph.structure.graph_implementation.simpleGraphImpl.number_of_edges
      • cugraph.structure.graph_implementation.simpleGraphImpl.in_degree
      • cugraph.structure.graph_implementation.simpleGraphImpl.out_degree
      • cugraph.structure.graph_implementation.simpleGraphImpl.degree
      • cugraph.structure.graph_implementation.simpleGraphImpl.degrees
      • cugraph.structure.graph_implementation.simpleGraphImpl.has_edge
      • cugraph.structure.graph_implementation.simpleGraphImpl.has_node
      • cugraph.structure.graph_implementation.simpleGraphImpl.has_self_loop
      • cugraph.structure.graph_implementation.simpleGraphImpl.edges
      • cugraph.structure.graph_implementation.simpleGraphImpl.nodes
      • cugraph.structure.graph_implementation.simpleGraphImpl.neighbors
      • cugraph.structure.graph_implementation.simpleGraphImpl.vertex_column_size
    • Property Graph
      • cugraph.experimental.PropertySelection
      • cugraph.experimental.PropertyGraph
      • cugraph.experimental.PropertyGraph.add_edge_data
      • cugraph.experimental.PropertyGraph.add_vertex_data
      • cugraph.experimental.PropertyGraph.annotate_dataframe
      • cugraph.experimental.PropertyGraph.edge_props_to_graph
      • cugraph.experimental.PropertyGraph.extract_subgraph
      • cugraph.experimental.PropertyGraph.get_edge_data
      • cugraph.experimental.PropertyGraph.get_num_edges
      • cugraph.experimental.PropertyGraph.get_num_vertices
      • cugraph.experimental.PropertyGraph.get_vertex_data
      • cugraph.experimental.PropertyGraph.get_vertices
      • cugraph.experimental.PropertyGraph.has_duplicate_edges
      • cugraph.experimental.PropertyGraph.is_multigraph
      • cugraph.experimental.PropertyGraph.renumber_edges_by_type
      • cugraph.experimental.PropertyGraph.renumber_vertices_by_type
      • cugraph.experimental.PropertyGraph.select_edges
      • cugraph.experimental.PropertyGraph.select_vertices
    • Centrality
      • cugraph.centrality.betweenness_centrality
      • cugraph.centrality.edge_betweenness_centrality
      • cugraph.dask.centrality.betweenness_centrality
      • cugraph.centrality.katz_centrality
      • cugraph.dask.centrality.katz_centrality.katz_centrality
      • cugraph.centrality.degree_centrality
      • cugraph.centrality.eigenvector_centrality
      • cugraph.dask.centrality.eigenvector_centrality.eigenvector_centrality
    • Community
      • cugraph.batched_ego_graphs
      • cugraph.ego_graph
      • cugraph.ecg
      • cugraph.k_truss
      • cugraph.ktruss_subgraph
      • cugraph.leiden
      • cugraph.louvain
      • cugraph.dask.community.louvain.louvain
      • cugraph.analyzeClustering_edge_cut
      • cugraph.analyzeClustering_modularity
      • cugraph.analyzeClustering_ratio_cut
      • cugraph.spectralBalancedCutClustering
      • cugraph.spectralModularityMaximizationClustering
      • cugraph.subgraph
      • cugraph.triangle_count
    • Components
      • cugraph.connected_components
      • cugraph.strongly_connected_components
      • cugraph.weakly_connected_components
      • cugraph.dask.components.connectivity.weakly_connected_components
    • Cores
      • cugraph.core_number
      • cugraph.k_core
    • Layout
      • cugraph.force_atlas2
    • Linear Assignment
      • cugraph.hungarian
      • cugraph.dense_hungarian
    • Link Analysis
      • cugraph.hits
      • cugraph.dask.link_analysis.hits.hits
      • cugraph.pagerank
      • cugraph.dask.link_analysis.pagerank.pagerank
    • Link Prediction
      • cugraph.jaccard
      • cugraph.jaccard_coefficient
      • cugraph.overlap
      • cugraph.overlap_coefficient
      • cugraph.sorensen
      • cugraph.sorensen_coefficient
    • Sampling
      • cugraph.random_walks
      • cugraph.ego_graph
      • cugraph.uniform_neighbor_sample
      • cugraph.node2vec
    • Traversal
      • cugraph.bfs
      • cugraph.bfs_edges
      • cugraph.dask.traversal.bfs.bfs
      • cugraph.filter_unreachable
      • cugraph.shortest_path
      • cugraph.shortest_path_length
      • cugraph.sssp
      • cugraph.dask.traversal.sssp.sssp
    • Tree
      • cugraph.tree.minimum_spanning_tree.minimum_spanning_tree
      • cugraph.tree.minimum_spanning_tree.maximum_spanning_tree
    • Generators
      • cugraph.generators.rmat
    • DASK MG Helper functions
      • cugraph.dask.comms.comms.initialize
      • cugraph.dask.comms.comms.destroy
      • cugraph.dask.comms.comms.is_initialized
      • cugraph.dask.comms.comms.get_comms
      • cugraph.dask.comms.comms.get_workers
      • cugraph.dask.comms.comms.get_session_id
      • cugraph.dask.comms.comms.get_2D_partition
      • cugraph.dask.comms.comms.get_default_handle
      • cugraph.dask.comms.comms.get_handle
      • cugraph.dask.comms.comms.get_worker_id
      • cugraph.dask.common.read_utils.get_chunksize
    • Multi-GPU with cuGraph
  • pylibcugraph API reference
    • pylibcugraph.eigenvector_centrality
    • pylibcugraph.katz_centrality
    • pylibcugraph.strongly_connected_components
    • pylibcugraph.weakly_connected_components
    • pylibcugraph.pagerank
    • pylibcugraph.hits
    • pylibcugraph.node2vec
    • pylibcugraph.bfs
    • pylibcugraph.sssp
  • cuGraph C API documentation
    • Centrality
    • Community
    • Core
    • Components
    • Sampling
    • Similarity
    • Traversal
  • cuGraph C++ API
    • Algorithmns
      • Centrality
      • Community
      • Sampling
      • Similarity
      • Traversal
      • Linear
      • Link Analysis
      • Layout
      • Tree
      • Utility Functions
    • Graph Functions
    • Graph Generators
    • Legacy Graph Functions
    • Sampling Functions
    • Collection Wrappers
    • Low Level cuGraph C++ API

Graph Neural Networks API Documentation

  • cugraph-pyg API Reference
    • cugraph_pyg.data.graph_store.GraphStore
    • cugraph_pyg.data.feature_store.TensorDictFeatureStore
    • cugraph_pyg.loader.node_loader.NodeLoader
    • cugraph_pyg.loader.neighbor_loader.NeighborLoader
    • cugraph_pyg.sampler.sampler.BaseSampler
    • cugraph_pyg.sampler.sampler.SampleReader
    • cugraph_pyg.sampler.sampler.HomogeneousSampleReader
    • cugraph_pyg.sampler.sampler.SampleIterator

Additional Graph Packages API Documentation

  • cugraph-service API Reference
    • cugraph-service-client API Reference
    • cugraph-service-server API Reference
  • API Reference
  • cugraph API Reference
  • Link Analysis
  • cugraph.dask.link_analysis.hits.hits

cugraph.dask.link_analysis.hits.hits#

cugraph.dask.link_analysis.hits.hits(input_graph, tol=1e-05, max_iter=100, nstart=None, normalized=True)[source]#

Compute HITS hubs and authorities values for each vertex

The HITS algorithm computes two numbers for a node. Authorities estimates the node value based on the incoming links. Hubs estimates the node value based on outgoing links.

Both cuGraph and networkx implementation use a 1-norm.

Parameters:
input_graphcugraph.Graph

cuGraph graph descriptor, should contain the connectivity information as an edge list (edge weights are not used for this algorithm). The adjacency list will be computed if not already present.

tolfloat, optional (default=1.0e-5)

Set the tolerance of the approximation, this parameter should be a small magnitude value.

max_iterint, optional (default=100)

The maximum number of iterations before an answer is returned.

nstartcudf.Dataframe, optional (default=None)

The initial hubs guess vertices along with their initial hubs guess value

nstart[‘vertex’]cudf.Series

Initial hubs guess vertices

nstart[‘values’]cudf.Series

Initial hubs guess values

normalizedbool, optional (default=True)

A flag to normalize the results

Returns:
HubsAndAuthoritiesdask_cudf.DataFrame

GPU distributed data frame containing three dask_cudf.Series of size V: the vertex identifiers and the corresponding hubs and authorities values.

df[‘vertex’]dask_cudf.Series

Contains the vertex identifiers

df[‘hubs’]dask_cudf.Series

Contains the hubs score

df[‘authorities’]dask_cudf.Series

Contains the authorities score

Examples

>>> import cugraph.dask as dcg
>>> import dask_cudf
>>> # ... Init a DASK Cluster
>>> #    see https://docs.rapids.ai/api/cugraph/stable/dask-cugraph.html
>>> # Download dataset from https://github.com/rapidsai/cugraph/datasets/..
>>> chunksize = dcg.get_chunksize(datasets_path / "karate.csv")
>>> ddf = dask_cudf.read_csv(datasets_path / "karate.csv",
...                          blocksize=chunksize, delimiter=" ",
...                          names=["src", "dst", "value"],
...                          dtype=["int32", "int32", "float32"])
>>> dg = cugraph.Graph(directed=True)
>>> dg.from_dask_cudf_edgelist(ddf, source='src', destination='dst',
...                            edge_attr='value')
>>> hits = dcg.hits(dg, max_iter = 50)

previous

cugraph.hits

next

cugraph.pagerank

On this page
  • hits()

This Page

  • Show Source

© Copyright 2024-2025, NVIDIA Corporation.

Created using Sphinx 8.1.3.

Built with the PyData Sphinx Theme 0.16.1.