adding UndirectedGraphs module and tests #100
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
Signed-off-by: Stephan Merz <[email protected]>
lemmy
reviewed
Feb 27, 2024
| (****************************************************************************) | ||
| ConnectedComponents(G) == | ||
| LET base == {{n} : n \in G.node} | ||
| choice(E) == CHOOSE e \in E : TRUE |
There was a problem hiding this comment.
Not related to this PR but choice(E) == ... should perhaps be added as an auxiliary definition in Folds.tla.
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.
I suggest adding a variant of the Graphs module for undirected graphs, in which edges are represented as unordered pairs {a,b} of nodes, thus enforcing symmetry. The module contains a union-find based operator for computing connected components of an undirected graph.