| | | 1 | | using Dotnet.Installer.Core.Models; |
| | | 2 | | |
| | | 3 | | namespace Dotnet.Installer.Core.Types; |
| | | 4 | | |
| | | 5 | | public class DependencyTree |
| | | 6 | | { |
| | 1 | 7 | | private readonly Dictionary<string, Component> _components = new(); |
| | | 8 | | |
| | 0 | 9 | | public DependencyTree() { } |
| | | 10 | | |
| | 1 | 11 | | public DependencyTree(IEnumerable<Component> components) |
| | 1 | 12 | | { |
| | 12 | 13 | | foreach (var component in components) _components[component.Key] = component; |
| | 1 | 14 | | } |
| | | 15 | | |
| | | 16 | | public void Add(Component component) |
| | 0 | 17 | | { |
| | 0 | 18 | | _components[component.Key] = component; |
| | 0 | 19 | | } |
| | | 20 | | |
| | | 21 | | public List<Component> GetReverseDependencies(string startKey) |
| | 3 | 22 | | { |
| | 3 | 23 | | List<Component> reverseDependencies = []; |
| | 3 | 24 | | HashSet<string> visited = []; |
| | | 25 | | |
| | 3 | 26 | | TraverseReverseDependencies(startKey, reverseDependencies, visited); |
| | 3 | 27 | | return reverseDependencies; |
| | 3 | 28 | | } |
| | | 29 | | |
| | | 30 | | private void TraverseReverseDependencies(string key, |
| | | 31 | | ICollection<Component> reverseDependencies, |
| | | 32 | | ICollection<string> visited) |
| | 6 | 33 | | { |
| | 6 | 34 | | if (!_components.TryGetValue(key, out var currentComponent) || visited.Contains(key)) |
| | 0 | 35 | | return; |
| | | 36 | | |
| | 6 | 37 | | visited.Add(key); |
| | | 38 | | |
| | 24 | 39 | | foreach (var kvp in _components.Where(kvp => |
| | 24 | 40 | | kvp.Value.Dependencies.Contains(key))) |
| | 3 | 41 | | { |
| | 3 | 42 | | TraverseReverseDependencies(kvp.Key, reverseDependencies, visited); |
| | 3 | 43 | | reverseDependencies.Add(kvp.Value); |
| | 3 | 44 | | } |
| | 6 | 45 | | } |
| | | 46 | | } |