facebookresearch / dachshund

Dachshund is a graph mining library written in Rust. It provides high performance data structures for multiple kinds of graphs, from simple undirected graphs to typed hypergraphs. Dachshund also provides algorithms for common tasks for graph mining and analysis, ranging from shortest paths to graph spectral analysis.

Summary

	TOML
		Main Code: 5,054 LOC (51 files) = RS (98%) + TOML (1%) Secondary code: Test: 2,703 LOC (12); Generated: 0 LOC (0); Build & Deploy: 0 LOC (0); Other: 120 LOC (3);
		Duplication: 14%
		File Size: 0% long (>1000 LOC), 57% short (<= 200 LOC)
		Unit Size: 0% long (>100 LOC), 51% short (<= 10 LOC)
		Conditional Complexity: 0% complex (McCabe index > 50), 67% simple (McCabe index <= 5)
		Logical Component Decomposition: primary (4 components)
		1 year, 5 months old 93% of code older than 365 days 19% of code not updated in the past 365 days
		0% of code updated more than 50 times Also see temporal dependencies for files frequently changed in same commits.
		Goals: Keep the system simple and easy to change (4)
	Features of interest: TODOs 7 files

Commits Trend

Latest commit date: 2021-11-08

0 commits (30 days) 0 contributors (30 days)

Commits 30 162 Contributors 3 6 2021 2020

show commits trend per language

Commits	2022 2021 2020 27 151 rs toml 11 20 toml
Contributors	2022 2021 2020 3 5 rs toml 3 6 toml