Crate trueno_graph 

trueno-graph has moved to aprender-graph.

This crate re-exports aprender-graph for backward compatibility. New code should depend on aprender-graph directly.

Modules

algorithms

Graph algorithms (BFS, PageRank, clustering, topological, structure, paths)

storage

Graph storage layer

Structs

CommunityDetectionResult

Community detection result

CsrGraph

CSR (Compressed Sparse Row) graph

Error

The Error type, a wrapper around a dynamic error type.

NodeId

Node identifier (zero-indexed)

Pattern

Pattern specification for matching

PatternMatch

Pattern matching result

Enums

Severity

Severity level for anti-patterns

Functions

bfs

Breadth-First Search from source node

connected_components

Count the number of weakly connected components in the graph

dijkstra

Compute single-source shortest paths using Dijkstra’s algorithm

dijkstra_path

find_callers

Find all functions that transitively call the target function

find_patterns

Find all pattern matches in the graph

is_cyclic

Check if the graph contains any cycles

kosaraju_scc

Find strongly connected components using Kosaraju’s algorithm

louvain

Detect communities using the Louvain algorithm

pagerank

Compute PageRank scores for all nodes in the graph

toposort

Compute topological ordering of a directed acyclic graph (DAG)

Type Aliases

Result

Result<T, Error>