Draw nodes with at least l edges.
#5
Merged
Conversation
This file contains 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
Adds the option `-l` to indicate the minimum number of edges a nodes is required to have before being inserted into the graph. Nodes having at least `l` edges, are inserted in the graph, including all their connections. By providing `-l 0` all nodes, including single nodes without any inbound or outbound edges, will be drawn. Closes #4.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Adds the option
-lto indicate the minimum number of edges a nodes isrequired to have before being inserted into the graph. Nodes having at
least
ledges, are inserted in the graph, including all theirconnections.
By providing
-l 0all nodes, including single nodes without anyinbound or outbound edges, will be drawn.
Closes #4.