{"id":26035403,"url":"https://github.com/nelsonbn/algorithms-data-structures-graph-traversal","last_synced_at":"2025-07-24T20:36:00.670Z","repository":{"id":280376373,"uuid":"941784690","full_name":"NelsonBN/algorithms-data-structures-graph-traversal","owner":"NelsonBN","description":"Algorithms and Data Structures - Graphs Traversal","archived":false,"fork":false,"pushed_at":"2025-03-03T03:46:40.000Z","size":0,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-03T04:27:47.504Z","etag":null,"topics":["algorithms","algorithms-and-data-structures","data-structures","graphs"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/NelsonBN.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2025-03-03T03:33:47.000Z","updated_at":"2025-03-03T03:46:43.000Z","dependencies_parsed_at":"2025-03-03T04:37:54.352Z","dependency_job_id":null,"html_url":"https://github.com/NelsonBN/algorithms-data-structures-graph-traversal","commit_stats":null,"previous_names":["nelsonbn/algorithms-data-structures-graph-traversal"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NelsonBN%2Falgorithms-data-structures-graph-traversal","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NelsonBN%2Falgorithms-data-structures-graph-traversal/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NelsonBN%2Falgorithms-data-structures-graph-traversal/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/NelsonBN%2Falgorithms-data-structures-graph-traversal/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/NelsonBN","download_url":"https://codeload.github.com/NelsonBN/algorithms-data-structures-graph-traversal/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242332579,"owners_count":20110345,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","algorithms-and-data-structures","data-structures","graphs"],"created_at":"2025-03-07T04:52:28.293Z","updated_at":"2025-03-07T04:52:28.810Z","avatar_url":"https://github.com/NelsonBN.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Algorithms and Data Structures - Graphs Traversal\n\n## Demos\n\n### From Matrix to Graph\n\n**Problem**\n\nGiven a matrix, we will traverse it with graph traversal techniques to find the target element.\n\n![Maze](./media/maze.svg)\n\n**Movements Graph**\n```mermaid\ngraph LR\n  A((0,0))\n  B((0,1))\n  C((0,2))\n  D((0,3))\n  E((1,1))\n  F((1,3))\n  G((2,0))\n  H((2,1))\n  I((2,2))\n  J((2,3))\n  K((3,0))\n  L((3,3))\n  M((4,1))\n  N((4,2))\n  O((4,3))\n\n  style B stroke:#0AF,stroke-width:2px;\n  style M stroke:#FA0,stroke-width:2px;\n\n  B \u003c--\u003e A\n  B \u003c--\u003e E\n  B \u003c--\u003e C\n  C \u003c--\u003e D\n  D \u003c--\u003e F\n  E \u003c--\u003e H\n  F \u003c--\u003e J\n  H \u003c--\u003e G\n  H \u003c--\u003e I\n  I \u003c--\u003e J\n  J \u003c--\u003e L\n  G \u003c--\u003e K\n  L \u003c--\u003e O\n  O \u003c--\u003e N\n  M \u003c--\u003e N\n```\n\n**Notes**\n- The position start is at (0,1) where the cell has the value 'S'\n- The target position is at (4,1) where the cell has the value 'E'\n- The cells with the value 'X' are blocked cells\n\n**Traversal**\n- [Matrix - DFS (Depth-First Search) Traversal](./src/matrix_dfs.py)\n- [Matrix - BFS (Breadth-First Search) Traversal](./src/matrix_bfs.py)\n\n\n## References\n- [Other Algorithms \u0026 Data Structures](https://github.com/NelsonBN/algorithms-data-structures)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnelsonbn%2Falgorithms-data-structures-graph-traversal","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnelsonbn%2Falgorithms-data-structures-graph-traversal","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnelsonbn%2Falgorithms-data-structures-graph-traversal/lists"}