I have been asked to create an application to solve the following problem.
Many patients and new staff members miss appointments and exams due to the complexity of a clinic. Although there is staff and signs that indicate the way to different departments, it is not possible to have a guide at every corner or hallway, nor to place a sign on every wall. Recently, an elderly lady missed an appointment because it took her an hour to reach the cardiology office. The hospital complex is quite large, composed of several buildings spread across 2 blocks. Sometimes, to go from one place to another, it is necessary to cross the street. There is a bridge connecting two buildings or an underground tunnel linking two buildings separated by the street. Some buildings are connected by an underground tunnel that goes through the basement of the parking lot. In addition, the height of the buildings varies: one has 3 floors, others have 5, and one has 10 floors. For now, the exact details are not very important.
Within the hospital complex, we find parking lots, offices, consultation rooms, hallways, elevators, stairs, restaurants, rooms, intensive care units, operating rooms, warehouses, a kitchen, waiting rooms, laundry facilities, and much more. It is a true maze. I have thought about creating a graph (network of nodes) where each office, room, etc., is a node, and using an algorithm like Dijkstra's to solve the problem. However, I have very limited knowledge about graphs. I am not looking for the most efficient, fastest, or resource-efficient algorithm, just the one that is easiest to implement in B4A.
I would like to hear your ideas on how to approach this problem using B4A.
Many patients and new staff members miss appointments and exams due to the complexity of a clinic. Although there is staff and signs that indicate the way to different departments, it is not possible to have a guide at every corner or hallway, nor to place a sign on every wall. Recently, an elderly lady missed an appointment because it took her an hour to reach the cardiology office. The hospital complex is quite large, composed of several buildings spread across 2 blocks. Sometimes, to go from one place to another, it is necessary to cross the street. There is a bridge connecting two buildings or an underground tunnel linking two buildings separated by the street. Some buildings are connected by an underground tunnel that goes through the basement of the parking lot. In addition, the height of the buildings varies: one has 3 floors, others have 5, and one has 10 floors. For now, the exact details are not very important.
Within the hospital complex, we find parking lots, offices, consultation rooms, hallways, elevators, stairs, restaurants, rooms, intensive care units, operating rooms, warehouses, a kitchen, waiting rooms, laundry facilities, and much more. It is a true maze. I have thought about creating a graph (network of nodes) where each office, room, etc., is a node, and using an algorithm like Dijkstra's to solve the problem. However, I have very limited knowledge about graphs. I am not looking for the most efficient, fastest, or resource-efficient algorithm, just the one that is easiest to implement in B4A.
I would like to hear your ideas on how to approach this problem using B4A.