Calculation of the number of non-backtracking walks (NBTWs) for simple graphs in Python.
Usage:
import nbtw
nbtw.get_nbtws(A,k)
(A = adjacency matrix, k = walk length)
-
Notifications
You must be signed in to change notification settings - Fork 0
ercco/NBTW
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Calculation of the number of non-backtracking walks (NBTWs) for simple graphs in Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published