| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.FindIfPathExistsInGraph; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindIfPathExistsInGraphBreadthFirstSearch : IFindIfPathExistsInGraph |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(v + e), where v is the number of vertices and e is the number of edges |
| | | 19 | | /// Space complexity - O(v + e), where v is the number of vertices and e is the number of edges |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="n"></param> |
| | | 22 | | /// <param name="edges"></param> |
| | | 23 | | /// <param name="source"></param> |
| | | 24 | | /// <param name="destination"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public bool ValidPath(int n, int[][] edges, int source, int destination) |
| | 2 | 27 | | { |
| | 2 | 28 | | if (source == destination) |
| | 0 | 29 | | { |
| | 0 | 30 | | return true; |
| | | 31 | | } |
| | | 32 | | |
| | 2 | 33 | | var graph = new Dictionary<int, List<int>>(); |
| | | 34 | | |
| | 22 | 35 | | for (var i = 0; i < n; i++) |
| | 9 | 36 | | { |
| | 9 | 37 | | graph[i] = []; |
| | 9 | 38 | | } |
| | | 39 | | |
| | 22 | 40 | | foreach (var edge in edges) |
| | 8 | 41 | | { |
| | 8 | 42 | | graph[edge[0]].Add(edge[1]); |
| | 8 | 43 | | graph[edge[1]].Add(edge[0]); |
| | 8 | 44 | | } |
| | | 45 | | |
| | 2 | 46 | | var queue = new Queue<int>(); |
| | | 47 | | |
| | 2 | 48 | | queue.Enqueue(source); |
| | | 49 | | |
| | 2 | 50 | | var visited = new HashSet<int>(source); |
| | | 51 | | |
| | 6 | 52 | | while (queue.Count > 0) |
| | 5 | 53 | | { |
| | 5 | 54 | | var current = queue.Dequeue(); |
| | | 55 | | |
| | 30 | 56 | | foreach (var neighbor in graph[current]) |
| | 8 | 57 | | { |
| | 8 | 58 | | if (neighbor == destination) |
| | 1 | 59 | | { |
| | 1 | 60 | | return true; |
| | | 61 | | } |
| | | 62 | | |
| | 7 | 63 | | if (visited.Add(neighbor)) |
| | 4 | 64 | | { |
| | 4 | 65 | | queue.Enqueue(neighbor); |
| | 4 | 66 | | } |
| | 7 | 67 | | } |
| | 4 | 68 | | } |
| | | 69 | | |
| | 1 | 70 | | return false; |
| | 2 | 71 | | } |
| | | 72 | | } |