Graph update #737
Merged
Graph update #737
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
|
The Label Bot has predicted the following:
|
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.
Proposed changes
I updated the Graph page to give an example of a graph, I also created images of that example graph. I then updated the list of graph types and used the example graph to demonstrate what I was talking about. Here is a list of the graph types I updated:
I also fixed the explanations for graph components, specifically I added the following:
Finally, I added a code example for adjacency matrices and gave examples for adjacency matrices and adjacency lists.
Types of changes
Checklist
Further comments
I use the same graph example, with sight variations, for all my explanations. I tried to be clear but if something doesn’t make sense, please let me know.