Skip to main content

Crate walk

Crate walk 

Source
Expand description

§walk (compatibility shim)

This crate now re-exports graphops and exists only for compatibility. New code should depend on and import graphops directly.

In other words:

  • Before: use walk::pagerank
  • After: use graphops::pagerank

Modules§

graph
Minimal graph adapter traits.
node2vec
Node2Vec / Node2Vec+ walk generation (OTF + PreComp).
pagerank
PageRank centrality.
partition
Graph partitioning / community detection.
ppr
Personalized PageRank.
random_walk
Random walk generation.
reachability
Reachability helpers (transitive closure counts).
topk
Ranking utilities.

Structs§

AdjacencyMatrix
PageRankConfig
PageRankRun
PrecomputedBiasedWalks
Precomputed alias tables for classic node2vec biased walks (unweighted).
WalkConfig
WeightedNode2VecPlusConfig
Parameters for weighted node2vec / node2vec+ walk generation.

Enums§

Error

Traits§

Graph
GraphRef
A graph view that can return borrowed neighbor slices.
WeightedGraph
WeightedGraphRef
A weighted graph view that can return borrowed neighbor + weight slices.

Functions§

connected_components
Connected components of an undirected graph, using BFS.
generate_biased_walks
generate_biased_walks_from_nodes
Node2Vec-style biased walk generation, restricted to an explicit set of start nodes.
generate_biased_walks_precomp_ref
generate_biased_walks_precomp_ref_from_nodes
Precomputed node2vec biased walks, restricted to an explicit set of start nodes.
generate_biased_walks_ref
Node2Vec-style biased walk generation for graphs that can return borrowed neighbor slices.
generate_biased_walks_ref_from_nodes
Node2Vec-style biased walk generation, restricted to an explicit set of start nodes.
generate_biased_walks_ref_streaming_from_nodes
Streaming node2vec-style biased walk generation (borrowed neighbor slices).
generate_biased_walks_weighted_plus_ref
generate_biased_walks_weighted_ref
generate_walks
generate_walks_from_nodes
Random walk generation (unbiased), but restricted to an explicit set of start nodes.
generate_walks_ref
Random walk generation for graphs that can return borrowed neighbor slices.
generate_walks_ref_from_nodes
Random walk generation (unbiased), but restricted to an explicit set of start nodes.
generate_walks_ref_streaming_from_nodes
Streaming unbiased random walk generation (borrowed neighbor slices).
label_propagation
Label propagation community detection (Raghavan et al., 2007).
normalize
Normalize scores to sum to 1.0. No-op if sum is zero.
pagerank
Compute PageRank scores for all nodes.
pagerank_checked
Checked PageRank centrality.
pagerank_checked_run
pagerank_run
PageRank with convergence reporting.
pagerank_weighted
Weighted PageRank centrality.
pagerank_weighted_checked
Checked weighted PageRank.
pagerank_weighted_checked_run
pagerank_weighted_run
personalized_pagerank
Compute Personalized PageRank with a teleport bias.
personalized_pagerank_checked
personalized_pagerank_checked_run
personalized_pagerank_run
reachability_counts_edges
Count transitive reachability for each node in a directed graph.
sample_start_nodes_reservoir
Deterministically sample up to k start nodes from 0..node_count.
top_k
Return the top-k entries by score (descending).

Type Aliases§

Result