issues
search
HeWeMel
/
nographs
NoGraphs is a library that simplifies the analysis of graphs that can not or should not be fully computed, stored or adapted, e.g., infinite graphs, large graphs and graphs with expensive computations.
https://nographs.readthedocs.io
MIT License
18
stars
1
forks
source link
issues
Newest
Newest
Most commented
Recently updated
Oldest
Least commented
Least recently updated
Meta Issue: Indexation of the 'nographs.readthedocs.io/en/stable/api.htm'
#26
leshabirukov
closed
3 months ago
1
`start_vertices` is unfriendly to laziness
#25
leshabirukov
closed
2 months ago
3
New algorithm: Iterate all paths
#24
HeWeMel
closed
2 months ago
1
Add example to tutorial: longest path in cycle-free directed graph
#23
HeWeMel
closed
8 months ago
1
Non-recursive DFS visits siblings in reversed order. Typical, but could be surprising. Should be documented.
#22
leshabirukov
closed
8 months ago
4
Elaborating on "Suggestion: Computing strongly connected components (SCC)..."
#20
leshabirukov
closed
9 months ago
1
is @functools.cache on next_* really works?
#2
leshabirukov
closed
11 months ago
12
Help about finding cycles in infinite graph.
#1
nguyenhieuec
closed
11 months ago
3