https://github.com/analiaburgosdev/java_oop_backtraching_salas
Java exercise using directed graphs to find the maximum path from the entrance to the exit room, passing through the most rooms possible.
https://github.com/analiaburgosdev/java_oop_backtraching_salas
algorithms directed-graph grafos java pathfinding-algorithm
Last synced: 4 months ago
JSON representation
Java exercise using directed graphs to find the maximum path from the entrance to the exit room, passing through the most rooms possible.
- Host: GitHub
- URL: https://github.com/analiaburgosdev/java_oop_backtraching_salas
- Owner: analiaBurgosDev
- Created: 2025-03-25T23:38:03.000Z (8 months ago)
- Default Branch: main
- Last Pushed: 2025-03-25T23:49:32.000Z (8 months ago)
- Last Synced: 2025-06-11T23:41:38.628Z (5 months ago)
- Topics: algorithms, directed-graph, grafos, java, pathfinding-algorithm
- Language: Java
- Homepage:
- Size: 10.7 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Máximo Recorrido en un Conjunto de Salas
## Descripción
Este ejercicio plantea la resolución de un problema donde un conjunto de salas está conectado por puertas que se abren en un solo sentido. Se debe construir un algoritmo que permita recorrer desde la sala de entrada hasta la de salida, atravesando la máxima cantidad de salas posible. El problema se puede modelar usando un grafo dirigido, donde cada sala es un nodo y cada puerta es un arco que dirige a otra sala.
## ¿Qué Aprendí?
Aprendí a modelar problemas de recorrido utilizando grafos dirigidos en Java. Aplicando algoritmos de búsqueda en grafos, como la búsqueda en profundidad (DFS), pude identificar el camino que atraviesa la mayor cantidad de nodos (salas).
## ¿Para Qué Sirve?
Este ejercicio demuestra mi capacidad para trabajar con grafos, una estructura de datos esencial en muchas áreas como redes de comunicación, planificación y análisis de rutas en mapas, y optimización de procesos.
--------------------------------------------------------------------------------------------------------------------------
# Maximum Path in a Set of Rooms
## Description
This exercise addresses the problem where a set of rooms is connected by doors that open in one direction only. The task is to construct an algorithm that allows traversing from the entrance room to the exit room, passing through the maximum number of rooms. This problem can be modeled using a directed graph, where each room is a node and each door is an arc leading to another room.
## What Did I Learn?
I learned how to model traversal problems using directed graphs in Java. By applying graph search algorithms like Depth-First Search (DFS), I was able to identify the path that passes through the most nodes (rooms).
## What Is It Useful For?
This exercise demonstrates my ability to work with graphs, a crucial data structure in various fields such as communication networks, route planning and analysis on maps, and process optimization.