Expand description
§GraphRust FFI Bindings
C/C++ bindings for the graphrust library using CXX for modern C++ integration and cbindgen for C compatibility.
Modules§
- cxx_
bindings - CXX-based C++ FFI bindings
- dijkstra
- Dijkstra’s shortest path algorithm implementation.
- pagerank
- PageRank algorithm implementation.
- triangle_
count - Triangle counting algorithm implementation.
Structs§
- FFIGraph
- FFI-friendly wrapper for Graph that can be passed across language boundaries
Functions§
- bfs_
distances - Returns distances from the start node to all reachable nodes.
- bfs_
predecessors - Returns predecessor map for path reconstruction.
- bfs_
traverse - Returns nodes in BFS visit order from the start node.
- clustering_
coefficient - Computes the global clustering coefficient of the graph.
- component_
count - Returns the number of connected components.
- connected_
components - Returns all connected components in the graph.
- create_
graph_ from_ edges - Helper function to create a graph from edge list (for FFI)
- dijkstra
- Computes shortest distances from start node to all reachable nodes.
- dijkstra_
path - Computes the shortest path from start to end node.
- dijkstra_
with_ predecessors - Computes shortest distances and predecessor map for path reconstruction.
- node_
component_ map - Returns a map from each node to its component ID.
- pagerank
- Computes PageRank scores for all nodes using a fixed number of iterations.
- pagerank_
converge - Computes PageRank scores using convergence criterion.
- top_
k_ pagerank - Returns top k nodes by PageRank score.
- triangle_
count - Counts the total number of triangles in the graph.
- triangles_
per_ node - Counts triangles each node participates in.