Refactor: Make Connectd a directional graph #19
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
ghost
commented
Mar 7, 2020
| connections : [EntryId]; | ||
| invitations : [EntryId]; | ||
| }; | ||
| public type Vertex = Nat32; |
There was a problem hiding this comment.
This should be PrincipalId once it's in the IDL.
eftychis
approved these changes
Mar 7, 2020
| }; | ||
|
|
||
| public func getAdjacent(vertex : Vertex) : [Vertex] { | ||
| var adjacencyList : [Vertex] = []; |
There was a problem hiding this comment.
This looks fine for now. Is there some expectation for the size of the graph?
This pull request was closed.
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.
Part III of #13.
Note: I may go back to tracking adjacency lists per vertex, but that won't change the interface.