Add wiki-link in tutorial.#157
Open
Erotemic wants to merge 1 commit into
Open
Conversation
Link to wikipedia on dynamic network analysis.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
I've been doing some searching for existing datastructure to maintain dynamic connectivity in general graphs, and I stumbled on this. I then learned that the dynamic graphs implemented by this library have to do with maintaining a history of how a graph is evolving over time, and it doesn't seem to have the tools I'm looking for. The tutorial and docs are a bit terse, so it took me a while to realize this. I think adding a link to the wiki page on dynamic network analysis - which more clearly defines the context - would have been helpful to me, so I'm writing this.
PS: if you have any recommendations for Python packages that do work with maintaining data structures to handle dynamic connectivity let me know. I know networkx itself has a UnionFind data structure (even though it's not integrated into a graph structure, I've written wrapper code that maintains UnionFind with the graph). What I'm really looking for now, is something that works similarly for directed graphs (i.e. quickly query all ancestors and descendents and update that as the graph is modified).