enum_machine-contrib 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 8e7266c9b63527eb71ba12e52d236c39dfb32f7efb2119a7171181b535030e9b
+  data.tar.gz: 1aff769ce18c3addf053e73bb7672727eda86ad3f4707dda11f45a0f50005900
+SHA512:
+  metadata.gz: 8135da25b19be77b3266baaa828d1e4e97bcf2cf8df76ceaca72c0cc394288b707629e39d6242c92446b6c4ff6b33e6e4dd39f5ef05ad0d6b875f5f15d706877
+  data.tar.gz: 90c6af41a3aacfc09659647ce9af33114a58c09fd68b3560cb73c6fec35235ffe9c2c54f783674025db1a609e0675a0fd275b6631330d664f3fc4852ac0aab5b

data/.rspec

@@ -0,0 +1,3 @@
+--format documentation
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,22 @@
+inherit_gem:
+  rubocop-gp:
+    - ./config/default.yml
+
+AllCops:
+  TargetRubyVersion: 2.6
+
+Rails/ApplicationRecord:
+  Enabled: false
+
+Metrics/ParameterLists:
+  CountKeywordArgs: false
+
+Style/Next:
+  Enabled: false
+
+Style/ClassVars:
+ Enabled: false
+
+Naming/FileName:
+  Exclude:
+    - lib/enum_machine-contrib.rb

data/CHANGELOG.md

@@ -0,0 +1,5 @@
+## [Unreleased]
+
+## [0.1.0] - 2023-02-28
+
+- Initial release

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at xronos.i.am@gmail.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/Gemfile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+source 'https://rubygems.org'
+
+gemspec
+
+gem 'enum_machine', github: 'corp-gp/enum_machine'
+gem 'priscilla', github: 'corp-gp/priscilla'
+gem 'pry', '~> 0.12'
+gem 'rake', '~> 13.0'
+gem 'rspec', '~> 3.9'
+gem 'rubocop-gp', github: 'corp-gp/rubocop-gp'

data/Gemfile.lock

@@ -0,0 +1,128 @@
+GIT
+  remote: https://github.com/corp-gp/enum_machine.git
+  revision: 644d24ec2c54fe5da7369ef3e0f61c199aa94116
+  specs:
+    enum_machine (0.1.0)
+      activemodel
+      activerecord
+      activesupport
+
+GIT
+  remote: https://github.com/corp-gp/priscilla.git
+  revision: 46ba7460df8209dfe80e344beed07dfe56648aaf
+  specs:
+    priscilla (1.0.3)
+      colorize (~> 0.7)
+      rumoji (~> 0.3)
+
+GIT
+  remote: https://github.com/corp-gp/rubocop-gp.git
+  revision: 133f07ae119a34f51f5e54cf4c7947334153ada4
+  specs:
+    rubocop-gp (0.0.2)
+      rubocop
+      rubocop-performance
+      rubocop-rails
+      rubocop-rspec
+
+PATH
+  remote: .
+  specs:
+    enum_machine-contrib (0.1.0)
+      activesupport
+      enum_machine
+      ruby-graphviz
+
+GEM
+  remote: https://rubygems.org/
+  specs:
+    activemodel (7.0.4.2)
+      activesupport (= 7.0.4.2)
+    activerecord (7.0.4.2)
+      activemodel (= 7.0.4.2)
+      activesupport (= 7.0.4.2)
+    activesupport (7.0.4.2)
+      concurrent-ruby (~> 1.0, >= 1.0.2)
+      i18n (>= 1.6, < 2)
+      minitest (>= 5.1)
+      tzinfo (~> 2.0)
+    ast (2.4.2)
+    coderay (1.1.3)
+    colorize (0.8.1)
+    concurrent-ruby (1.2.2)
+    diff-lcs (1.5.0)
+    i18n (1.12.0)
+      concurrent-ruby (~> 1.0)
+    json (2.6.3)
+    method_source (1.0.0)
+    minitest (5.17.0)
+    parallel (1.22.1)
+    parser (3.2.1.0)
+      ast (~> 2.4.1)
+    pry (0.14.2)
+      coderay (~> 1.1)
+      method_source (~> 1.0)
+    rack (3.0.4.1)
+    rainbow (3.1.1)
+    rake (13.0.6)
+    regexp_parser (2.7.0)
+    rexml (3.2.5)
+    rspec (3.12.0)
+      rspec-core (~> 3.12.0)
+      rspec-expectations (~> 3.12.0)
+      rspec-mocks (~> 3.12.0)
+    rspec-core (3.12.1)
+      rspec-support (~> 3.12.0)
+    rspec-expectations (3.12.2)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.12.0)
+    rspec-mocks (3.12.3)
+      diff-lcs (>= 1.2.0, < 2.0)
+      rspec-support (~> 3.12.0)
+    rspec-support (3.12.0)
+    rubocop (1.46.0)
+      json (~> 2.3)
+      parallel (~> 1.10)
+      parser (>= 3.2.0.0)
+      rainbow (>= 2.2.2, < 4.0)
+      regexp_parser (>= 1.8, < 3.0)
+      rexml (>= 3.2.5, < 4.0)
+      rubocop-ast (>= 1.26.0, < 2.0)
+      ruby-progressbar (~> 1.7)
+      unicode-display_width (>= 2.4.0, < 3.0)
+    rubocop-ast (1.27.0)
+      parser (>= 3.2.1.0)
+    rubocop-capybara (2.17.1)
+      rubocop (~> 1.41)
+    rubocop-performance (1.16.0)
+      rubocop (>= 1.7.0, < 2.0)
+      rubocop-ast (>= 0.4.0)
+    rubocop-rails (2.18.0)
+      activesupport (>= 4.2.0)
+      rack (>= 1.1)
+      rubocop (>= 1.33.0, < 2.0)
+    rubocop-rspec (2.18.1)
+      rubocop (~> 1.33)
+      rubocop-capybara (~> 2.17)
+    ruby-graphviz (1.2.5)
+      rexml
+    ruby-progressbar (1.11.0)
+    rumoji (0.5.0)
+    tzinfo (2.0.6)
+      concurrent-ruby (~> 1.0)
+    unicode-display_width (2.4.2)
+
+PLATFORMS
+  x86_64-linux
+
+DEPENDENCIES
+  enum_machine!
+  enum_machine-contrib!
+  priscilla!
+  pry (~> 0.12)
+  rake (~> 13.0)
+  rspec (~> 3.9)
+  rubocop-gp!
+
+BUNDLED WITH
+   2.4.6

data/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2023 corp-gp
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2023 Sergei Malykh
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,79 @@
+# EnumMachine extensions and tools
+
+This repository contains extensions and development tools for the [enum_machine](https://github.com/corp-gp/enum_machine)
+
+## Installation
+
+Install the gem and add to the application's Gemfile by executing:
+
+    $ bundle add enum_machine-contrib ruby-graphviz --group "development"
+
+If bundler is not being used to manage dependencies, install the gem by executing:
+
+    $ gem install enum_machine-contrib ruby-graphviz
+
+The gem depends on [GraphViz](https://graphviz.org/). See the [installation notes](https://graphviz.org/download/)
+
+## Usage
+
+Suppose we have `Order` AR-model with the state machine specified by [enum_machine](https://github.com/corp-gp/enum_machine)
+
+`config/initializers/enum_machine.rb`
+```ruby
+require 'enum_machine_contrib/enum_machine'
+```
+
+`app/models/order.rb`
+```ruby
+class Order < ActiveRecord::Base
+  enum_machine :state, %w[s0 s1 s2 s3 s3.1 s3.2 s4 s4.1 s4.2 s5 s6 s6.1 s6.2 s7 s8 s9 s10 s11] do
+    transitions(
+      nil    => %w[s0],
+      's0'   => %w[s1],
+      's1'   => %w[s2],
+      's2'   => %w[s3],
+      's3'   => %w[s3.1 s3.2 s4],
+      's3.1' => %w[s1],
+      's3.2' => %w[s1],
+      's4'   => %w[s4.1 s4.2 s5],
+      's4.1' => %w[s2],
+      's4.2' => %w[s2],
+      's5'   => %w[s6.1 s6.2],
+      's6.2' => %w[s7],
+      's6.1' => %w[s8],
+      's8'   => %w[s9],
+      's9'   => %w[s10],
+      's7'   => %w[s11],
+      's10'  => %w[s11],
+    )
+  end
+end
+```
+
+The gem allows you to get a visual representation of the graph of state transitions.
+
+```ruby
+Order::STATE.machine.decision_tree.visualize.output(png: 'states.png')
+```
+
+You will see:
+
+![states.png](states.png?raw=true "states")
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and the created tag, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/enum_machine-contrib. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [code of conduct](https://github.com/[USERNAME]/enum_machine-contrib/blob/master/CODE_OF_CONDUCT.md).
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+
+## Code of Conduct
+
+Everyone interacting in the EnumMachine::Contrib project's codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/enum_machine-contrib/blob/master/CODE_OF_CONDUCT.md).

data/Rakefile

@@ -0,0 +1,12 @@
+# frozen_string_literal: true
+
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+
+require 'rubocop/rake_task'
+
+RuboCop::RakeTask.new
+
+task default: %i[spec rubocop]

data/enum_machine-contrib.gemspec

@@ -0,0 +1,41 @@
+# frozen_string_literal: true
+
+require_relative 'lib/enum_machine_contrib/version'
+
+Gem::Specification.new do |spec|
+  spec.name = 'enum_machine-contrib'
+  spec.version = EnumMachineContrib::VERSION
+  spec.authors = ['Sergei Malykh']
+  spec.email = ['xronos.i.am@gmail.com']
+
+  spec.summary = 'extensions and tools for enum_machine'
+  spec.homepage = 'https://github.com/corp-gp/enum_machine-contrib'
+  spec.license = 'MIT'
+  spec.required_ruby_version = '>= 2.6.0'
+
+  spec.metadata['allowed_push_host'] = 'https://rubygems.org'
+
+  spec.metadata['homepage_uri'] = spec.homepage
+  spec.metadata['source_code_uri'] = 'https://github.com/corp-gp/enum_machine-contrib'
+  spec.metadata['changelog_uri'] = 'https://github.com/corp-gp/enum_machine-contrib/CHANGELOG.md'
+
+  # Specify which files should be added to the gem when it is released.
+  # The `git ls-files -z` loads the files in the RubyGem that have been added into git.
+  spec.files =
+    Dir.chdir(__dir__) do
+      `git ls-files -z`.split("\x0").reject do |f|
+        (f == __FILE__) || f.match(%r{\A(?:(?:bin|test|spec|features)/|\.(?:git|circleci)|appveyor)})
+      end
+    end
+  spec.bindir = 'exe'
+  spec.executables = spec.files.grep(%r{\Aexe/}) { |f| File.basename(f) }
+  spec.require_paths = ['lib']
+
+  spec.add_dependency 'activesupport'
+  spec.add_dependency 'enum_machine'
+  spec.add_dependency 'ruby-graphviz'
+
+  # For more information and examples about making a new gem, check out our
+  # guide at: https://bundler.io/guides/creating_gem.html
+  spec.metadata['rubygems_mfa_required'] = 'true'
+end

data/lib/enum_machine-contrib.rb

@@ -0,0 +1,3 @@
+# frozen_string_literal: true
+
+require 'enum_machine_contrib'

data/lib/enum_machine_contrib/decision_graph.rb

@@ -0,0 +1,205 @@
+# frozen_string_literal: true
+
+module EnumMachineContrib
+  class DecisionGraph
+
+    attr_accessor :vertexes, :edges
+
+    def initialize(graph)
+      @vertexes = Set.new
+      @edges    = Set.new
+
+      vertex_by_value = {}
+      graph.each do |from_value, to_value_list|
+        from_value = array_wrap(from_value)
+        vertex_by_value[from_value] ||= Vertex[from_value]
+        from_vertex = vertex_by_value[from_value]
+        @vertexes << from_vertex
+
+        to_value_list.sort_by(&:to_s).each do |to_value|
+          to_value = array_wrap(to_value)
+          vertex_by_value[to_value] ||= Vertex[to_value]
+          to_vertex = vertex_by_value[to_value]
+          @vertexes << to_vertex
+
+          @edges << from_vertex.add_edge(to_vertex)
+        end
+      end
+    end
+
+    def decision_tree
+      drop_self_cycled_edges!
+      combine_equal_vertexes!
+
+      loop do
+        complexity_was = complexity
+
+        decision_tree = DecisionTree.wrap(to_h)
+        decision_tree.resolve!
+        resolved_decision_tree = decision_tree.resolved
+
+        edges.each do |edge|
+          next unless resolved_decision_tree.key?(edge.from.value)
+
+          if resolved_decision_tree[edge.from.value].any? { |to_value_list| to_value_list.include?(edge.to.value) }
+            edge.resolved!
+          end
+        end
+
+        strongly_connected_components = decision_tree.values.filter(&:cycled?)
+        strongly_connected_components.each do |strongly_connected_component|
+          resolve_strong_component!(strongly_connected_component)
+        end
+
+        break if complexity == complexity_was
+      end
+
+      decision_tree = DecisionTree[vertexes.index_by(&:value)]
+      decision_tree.resolve!
+      decision_tree
+    end
+
+    def to_h
+      vertexes.filter(&:active?).to_h do |vertex|
+        [
+          vertex.value,
+          vertex.outcoming_edges.filter_map { |edge| edge.to.value if edge.active? },
+        ]
+      end
+    end
+
+    private def complexity
+      edges.count(&:active?)
+    end
+
+    private def drop_self_cycled_edges!
+      edges.each do |edge|
+        edge.dropped! if edge.from == edge.to
+      end
+    end
+
+    private def combine_equal_vertexes!
+      vertexes.group_by { |vertex| [vertex.incoming_edges.map(&:from), vertex.outcoming_edges.map(&:to)] }.each_value do |combining_vertexes|
+        next if combining_vertexes.size < 2
+
+        new_vertex = Vertex.replace!(combining_vertexes)
+        new_vertex.combined!
+
+        @vertexes << new_vertex
+
+        @edges.merge(new_vertex.incoming_edges)
+        @edges.merge(new_vertex.outcoming_edges)
+      end
+    end
+
+    def resolve_strong_component!(component_cycled_vertex) # rubocop:disable Metrics/CyclomaticComplexity,Metrics/PerceivedComplexity
+      input_values  = component_cycled_vertex.incoming_edges.filter(&:active?).flat_map { |edge| edge.from.value }
+      output_values = component_cycled_vertex.outcoming_edges.filter(&:active?).flat_map { |vertex| vertex.to.value }
+
+      active_vertexes = vertexes.filter(&:active?)
+      input_vertexes = active_vertexes.filter { |vertex| (input_values & vertex.value).any? }
+      output_vertexes = active_vertexes.filter { |vertex| (output_values & vertex.value).any? }
+
+      component_vertexes = active_vertexes.filter { |vertex| (component_cycled_vertex.value & vertex.value).any? }
+
+      single_incoming_vertexes = (component_vertexes + output_vertexes).filter { |vertex| vertex.incoming_edges.size == 1 }
+      single_incoming_vertexes.each do |to_vertex|
+        from_vertex = to_vertex.incoming_edges.first.from
+
+        (from_vertex.incoming_edges + from_vertex.outcoming_edges)
+          .group_by { |edge| [edge.from.value.to_s, edge.to.value.to_s].sort }
+          .values
+          .filter { |current_edges| current_edges.size > 1 }.each do |current_edges|
+            current_edges.each do |edge|
+              # S1 -> S2; S2 -> [S1, S3]
+              # drops back reference S2 -> S1
+              edge.dropped! if edge.from == from_vertex
+            end
+          end
+      end
+
+      resolved_not_visited_vertexes = []
+
+      current_vertexes = [component_cycled_vertex]
+      loop do
+        next_vertexes = current_vertexes.flat_map { |vertex| vertex.outcoming_edges.filter_map { |edge| edge.to if edge.active? } }
+        resolved_not_visited_vertexes += next_vertexes.reject(&:cycled?)
+        current_vertexes = next_vertexes
+        break if next_vertexes.empty?
+      end
+
+      single_incoming_chains = []
+      single_incoming_vertexes.each do |vertex|
+        single_incoming_edge = vertex.incoming_edges.first
+        # S1 -> [S2, S3]; S2 -> S3
+        # resolve S1 -> S2 because it is only one path to S2
+        single_incoming_edge.resolved!
+
+        resolved_not_visited_vertexes << single_incoming_edge.to
+
+        current_chain = single_incoming_chains.detect { |chain| chain.first == single_incoming_edge.to || chain.last == single_incoming_edge.from }
+        if current_chain
+          current_chain.replace(
+            if current_chain.first == single_incoming_edge.to
+              current_chain.unshift(single_incoming_edge.from)
+            else
+              current_chain.push(single_incoming_edge.to)
+            end,
+          )
+        else
+          single_incoming_chains << [single_incoming_edge.from, single_incoming_edge.to]
+        end
+      end
+
+      single_incoming_chains.each do |chain|
+        chain.flat_map { |vertex| vertex.outcoming_edges.to_a }.group_by(&:to).each_value do |outcoming_edges|
+          next if outcoming_edges.size < 2
+
+          # S1 -> [S2, S3]; S2 -> S3
+          # drops S1 -> S3, because S1 -> S2 resolved as only one path and S3 is reachable from S2
+          outcoming_edges[0..outcoming_edges.size - 2].each(&:dropped!)
+        end
+      end
+
+      current_vertexes = input_vertexes
+      visited_vertexes = []
+      loop do
+        current_following_vertexes = current_vertexes.flat_map { |vertex| vertex.outcoming_edges.map(&:to) }.uniq - visited_vertexes
+
+        if current_following_vertexes.size > 1
+          reachable_vertexes = resolved_not_visited_vertexes.flat_map { |vertex| vertex.outcoming_edges.map(&:to) }.uniq
+          break if reachable_vertexes.empty?
+
+          current_following_vertexes -= reachable_vertexes
+        end
+
+        current_vertexes.each do |from_vertex|
+          from_vertex.outcoming_edges.each do |edge|
+            next if edge.resolved?
+
+            if current_following_vertexes.include?(edge.to)
+              edge.resolved! if current_following_vertexes.size == 1
+            elsif resolved_not_visited_vertexes.include?(edge.to)
+              edge.dropped!
+            end
+          end
+        end
+
+        current_vertexes = current_following_vertexes
+        resolved_not_visited_vertexes -= current_following_vertexes
+        visited_vertexes += current_vertexes
+
+        break if current_vertexes.empty?
+      end
+    end
+
+    def array_wrap(value)
+      if value.nil?
+        [nil]
+      else
+        Array.wrap(value)
+      end
+    end
+
+  end
+end

data/lib/enum_machine_contrib/decision_tree.rb

@@ -0,0 +1,168 @@
+# frozen_string_literal: true
+
+require 'tsort'
+
+module EnumMachineContrib
+  class DecisionTree < Hash
+
+    include TSort
+
+    def tsort_each_child(node, &_block)
+      fetch(node).outcoming_edges.each { |edge| yield(edge.to.value) if edge.active? }
+    end
+
+    def tsort_each_node(&_block)
+      each_value { |vertex| yield(vertex.value) if vertex.active? }
+    end
+
+    def self.wrap(hsh)
+      vertex_by_value = {}
+
+      hsh.each do |from_value, to_value_list|
+        vertex_by_value[from_value] ||= Vertex[from_value]
+        from_vertex = vertex_by_value[from_value]
+
+        to_value_list.each do |to_value|
+          vertex_by_value[to_value] ||= Vertex[to_value]
+          from_vertex.add_edge(vertex_by_value[to_value])
+        end
+      end
+
+      DecisionTree[vertex_by_value]
+    end
+
+    def resolve!
+      strongly_connected_components.each do |strongly_connected_values|
+        next if strongly_connected_values.size < 2
+
+        clusterize_strong_component!(values_at(*strongly_connected_values))
+      end
+
+      values_topological_sorted = tsort.reverse
+      vertexes_topological_sorted = values_at(*values_topological_sorted)
+
+      start_vertex = vertexes_topological_sorted.shift
+      start_vertex.level = 0
+
+      visited_vertexes = [].unshift(start_vertex)
+
+      vertexes_topological_sorted.each do |to_vertex|
+        current_edge = nil
+
+        visited_vertexes.each do |vertex|
+          current_edge = fetch(vertex.value).outcoming_edges.detect { |edge| edge.to == to_vertex }
+          break if current_edge
+        end
+
+        to_vertex.level = current_edge.from.level + 1
+        current_edge.resolved!
+
+        visited_vertexes.unshift(to_vertex)
+      end
+
+      each_value do |vertex|
+        vertex.outcoming_edges.each do |edge|
+          edge.dropped! unless edge.resolved?
+        end
+      end
+    end
+
+    def resolved
+      resolved_hash = {}
+
+      each_value do |vertex|
+        next unless vertex.active?
+
+        resolved_hash[vertex.value] = vertex.outcoming_edges.filter_map { |edge| edge.to.value if edge.active? }
+      end
+
+      resolved_hash
+    end
+
+    ACTIVE_EDGE_STYLE   = 'color=red penwidth=2'
+    INACTIVE_EDGE_STYLE = 'color=grey'
+
+    CLEAN_ID = proc { |s| s.gsub(/[^[[:alnum:]]]/, '_') }
+
+    def as_dot # rubocop:disable Metrics/CyclomaticComplexity,Metrics/PerceivedComplexity
+      combined_values  = values.filter(&:combined?).flat_map(&:value).to_set
+      visible_vertexes = values.reject { |vertex| (combined_values & vertex.value).any? && !vertex.combined? }
+
+      cycled_vertexes, plain_vertexes = visible_vertexes.partition(&:cycled?)
+
+      nodes =
+        visible_vertexes
+          .map.with_index { |vertex, cluster_id|
+          [
+            vertex,
+            if vertex.value.compact.blank?
+              { id: 'null', label: 'nil' }
+            elsif vertex.combined?
+              { id: vertex.value.map(&CLEAN_ID).join('__'), label: vertex.value.join('/') }
+            elsif vertex.cycled?
+              { id: vertex.value[0].then(&CLEAN_ID), cluster_id: "cluster_#{cluster_id}" }
+            else
+              { id: vertex.value.join.then(&CLEAN_ID), label: vertex.value.join }
+            end,
+          ]
+        }
+          .to_h
+
+      vertexes_by_level = visible_vertexes.filter(&:level).sort_by(&:level).group_by(&:level)
+      node_ranks =
+        vertexes_by_level.map do |_level, vertexes_same_rank|
+          "{ rank=same #{vertexes_same_rank.reject(&:combined?).reject(&:cycled?).map { |vertex| nodes[vertex][:id] }.join(' ')} }"
+        end
+
+      node_labels = plain_vertexes.map { |vertex| "#{nodes[vertex][:id]} [label=\"#{nodes[vertex][:label]}\"]" }
+
+      clusters =
+        cycled_vertexes.map do |vertex|
+          "subgraph #{nodes[vertex][:cluster_id]} { color=blue style=dashed #{vertex.value.join(' ')} }"
+        end
+
+      transitions =
+        visible_vertexes.flat_map do |vertex|
+          vertex.outcoming_edges.filter_map do |edge|
+            if (!edge.from.combined? && (combined_values & edge.from.value).any?) ||
+               (!edge.to.combined? && (combined_values & edge.to.value).any?)
+              next
+            end
+
+            attrs = []
+            if edge.active?
+              attrs << ACTIVE_EDGE_STYLE
+              attrs << "ltail=#{nodes[edge.from][:cluster_id]}" if edge.from.cycled?
+              attrs << "lhead=#{nodes[edge.to][:cluster_id]}" if edge.to.cycled?
+            else
+              attrs << INACTIVE_EDGE_STYLE
+            end
+            "#{nodes[edge.from][:id]} -> #{nodes[edge.to][:id]} [#{attrs.join(' ')}]"
+          end
+        end
+
+      <<~DOT
+        digraph {
+          ranksep="1.0 equally"
+          compound=true
+          #{clusters.join("\n")}
+          #{node_labels.join('; ')}
+          #{node_ranks.join('; ')}
+          #{transitions.join("\n")}
+        }
+      DOT
+    end
+
+    def visualize
+      GraphViz.parse_string(as_dot)
+    end
+
+    private def clusterize_strong_component!(replacing_vertexes)
+      new_vertex = Vertex.replace!(replacing_vertexes)
+      new_vertex.cycled!
+
+      self[new_vertex.value] = new_vertex
+    end
+
+  end
+end

data/lib/enum_machine_contrib/edge.rb

@@ -0,0 +1,53 @@
+# frozen_string_literal: true
+
+module EnumMachineContrib
+
+  Edge =
+    Struct.new(:from, :to) do
+      attr_accessor :mode
+
+      EDGE_MODES = %i[pending resolved dropped].freeze # rubocop:disable Lint/ConstantDefinitionInBlock
+
+      def initialize(from, to)
+        self.from = from
+        self.to   = to
+
+        pending!
+      end
+
+      EDGE_MODES.each do |mode|
+        class_eval <<-RUBY, __FILE__, __LINE__ + 1
+          # def resolved!
+          #   self.mode = :resolved
+          # end
+          # def resolved?
+          #   self.mode == :resolved
+          # end
+
+          def #{mode}!
+            self.mode = :#{mode}
+          end
+          def #{mode}?
+            self.mode == :#{mode}
+          end
+        RUBY
+      end
+
+      def active?
+        !dropped?
+      end
+
+      def resolved!
+        self.mode = :resolved
+
+        to.incoming_edges.each do |edge|
+          edge.dropped! unless edge == self
+        end
+      end
+
+      def inspect
+        "<Edge [#{mode}] #{from.inspect} -> #{to.inspect}>"
+      end
+    end
+
+end

data/lib/enum_machine_contrib/enum_machine.rb

@@ -0,0 +1,13 @@
+# frozen_string_literal: true
+
+module EnumMachine
+
+  class Machine
+
+    include EnumMachineContrib::HasDecisionTree
+
+  end
+
+  class InvalidTransitionGraph < StandardError; end
+
+end

data/lib/enum_machine_contrib/has_decision_tree.rb

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+module EnumMachineContrib
+  module HasDecisionTree
+
+    def decision_tree
+      start_values = @transitions.keys - @transitions.values.flatten.uniq
+      raise EnumMachine::InvalidTransitionGraph, 'There is no start value' if start_values.empty?
+      raise EnumMachine::InvalidTransitionGraph, 'Multiple graphs detected' if start_values.size > 1
+
+      DecisionGraph.new(@transitions).decision_tree
+    end
+
+  end
+end

data/lib/enum_machine_contrib/version.rb

@@ -0,0 +1,7 @@
+# frozen_string_literal: true
+
+module EnumMachineContrib
+
+  VERSION = '0.1.0'
+
+end

data/lib/enum_machine_contrib/vertex.rb

@@ -0,0 +1,88 @@
+# frozen_string_literal: true
+
+module EnumMachineContrib
+
+  Vertex =
+    Struct.new(:value) do
+      attr_accessor :mode, :incoming_edges, :outcoming_edges, :level
+
+      VERTEX_MODES = %i[plain dropped combined cycled].freeze # rubocop:disable Lint/ConstantDefinitionInBlock
+
+      def initialize(value)
+        self.value = value
+        self.outcoming_edges = Set.new
+        self.incoming_edges = Set.new
+
+        plain!
+      end
+
+      VERTEX_MODES.each do |mode|
+        class_eval <<-RUBY, __FILE__, __LINE__ + 1
+          # def combined!
+          #   self.mode = :combined
+          # end
+          # def combined?
+          #   self.mode == :combined
+          # end
+
+          def #{mode}!
+            self.mode = :#{mode}
+          end
+          def #{mode}?
+            self.mode == :#{mode}
+          end
+        RUBY
+      end
+
+      def active?
+        !dropped?
+      end
+
+      def dropped!
+        return if dropped?
+
+        self.mode = :dropped
+
+        incoming_edges.each(&:dropped!)
+        outcoming_edges.each(&:dropped!)
+      end
+
+      def add_edge(to_vertex)
+        new_edge = Edge.new(self, to_vertex)
+
+        outcoming_edges << new_edge
+        to_vertex.incoming_edges << new_edge
+
+        new_edge
+      end
+
+      def self.replace!(replacing_vertexes)
+        new_vertex = Vertex[replacing_vertexes.flat_map(&:value)]
+
+        replacing_vertexes.each do |replacing_vertex|
+          replacing_vertex.incoming_edges.each do |edge|
+            next unless edge.active?
+            next if replacing_vertexes.include?(edge.from)
+
+            edge.from.add_edge(new_vertex)
+          end
+
+          replacing_vertex.outcoming_edges.filter_map do |edge|
+            next unless edge.active?
+            next if replacing_vertexes.include?(edge.to)
+
+            new_vertex.add_edge(edge.to)
+          end
+
+          replacing_vertex.dropped!
+        end
+
+        new_vertex
+      end
+
+      def inspect
+        "<Vertex [#{mode}] value=#{value || 'nil'}>"
+      end
+    end
+
+end

data/lib/enum_machine_contrib.rb

@@ -0,0 +1,17 @@
+# frozen_string_literal: true
+
+require 'enum_machine'
+require 'active_support/core_ext/enumerable'
+require 'active_support/core_ext/array/wrap'
+
+require 'enum_machine_contrib/version'
+
+module EnumMachineContrib
+
+  autoload :HasDecisionTree, 'enum_machine_contrib/has_decision_tree'
+  autoload :DecisionGraph, 'enum_machine_contrib/decision_graph'
+  autoload :DecisionTree, 'enum_machine_contrib/decision_tree'
+  autoload :Vertex, 'enum_machine_contrib/vertex'
+  autoload :Edge, 'enum_machine_contrib/edge'
+
+end

metadata

@@ -0,0 +1,111 @@
+--- !ruby/object:Gem::Specification
+name: enum_machine-contrib
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Sergei Malykh
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2023-03-14 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: activesupport
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: enum_machine
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: ruby-graphviz
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: 
+email:
+- xronos.i.am@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".rspec"
+- ".rubocop.yml"
+- CHANGELOG.md
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE
+- LICENSE.txt
+- README.md
+- Rakefile
+- enum_machine-contrib.gemspec
+- lib/enum_machine-contrib.rb
+- lib/enum_machine_contrib.rb
+- lib/enum_machine_contrib/decision_graph.rb
+- lib/enum_machine_contrib/decision_tree.rb
+- lib/enum_machine_contrib/edge.rb
+- lib/enum_machine_contrib/enum_machine.rb
+- lib/enum_machine_contrib/has_decision_tree.rb
+- lib/enum_machine_contrib/version.rb
+- lib/enum_machine_contrib/vertex.rb
+- states.png
+homepage: https://github.com/corp-gp/enum_machine-contrib
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+  homepage_uri: https://github.com/corp-gp/enum_machine-contrib
+  source_code_uri: https://github.com/corp-gp/enum_machine-contrib
+  changelog_uri: https://github.com/corp-gp/enum_machine-contrib/CHANGELOG.md
+  rubygems_mfa_required: 'true'
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: 2.6.0
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.4.6
+signing_key: 
+specification_version: 4
+summary: extensions and tools for enum_machine
+test_files: []