Repository navigation
Public structure summary and path/cut set counts - #371
Merged
Merged
Conversation
structure_summary(), count_minimal_path_sets() and count_minimal_cut_sets() report the size of a diagram's structure (components, modules, nesting, core, set counts) without listing the sets. Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_019Km2eWBiPJ5JNkme3vRg4B
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
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.
Reports how big a diagram's structure is without listing its path or cut sets:
RBD.structure_summary()(aStructureSummary: components, irrelevant components, modules, nesting depth, core size, counts of minimal path and cut sets, whether the counts are exact, and why a too-meshed diagram has none), pluscount_minimal_path_sets()andcount_minimal_cut_sets(). Counts come from the modular reduction (series multiplies/parallel adds, k-of-n sums, core over its term sets).Checked: counts equal the listed sets on random diagrams, a bridge, a ladder and every catalogue diagram (upper bounds for repeated nodes), and hand counts (series, parallel, 2-of-3 voting, cross-linked). Docs, changelog, route/capability tables updated. No existing method changed.
🤖 Generated with Claude Code
https://claude.ai/code/session_019Km2eWBiPJ5JNkme3vRg4B