icentral-match 0.1.0

Provides constructs for graph-based computations and detailed analysis of betweenness centrality within undirected graphs.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

[dependencies.icentral-3p]
version = "0.1.0"

[dependencies.icentral-mock]
version = "0.1.0"

[dependencies.icentral-nodeid]
version = "0.1.0"

[dependencies.icentral-scores]
version = "0.1.0"

[lib]
name = "icentral_match"
path = "src/lib.rs"

[package]
autobenches = false
autobins = false
autoexamples = false
autolib = false
autotests = false
build = false
categories = ["algorithms", "science", "simulation", "mathematics"]
description = "Provides constructs for graph-based computations and detailed analysis of betweenness centrality within undirected graphs."
edition = "2021"
keywords = ["graphtheory", "networkanalysis", "dachshund", "graphalgorithms"]
license = "MIT OR Apache-2.0"
name = "icentral-match"
readme = "README.md"
version = "0.1.0"