Please help me complete my main. I$\text{'}$m working on a route management system in Java, aimed at calculating and optimizing routes between different locations using algorithms and data structures. Each location will be represented as a node in an undirected graph, and connections between locations will be modeled as edges. These edges should have weight and time attributes. I have all the calculation methods already done, but I need to know if they work and why I have to make the user interaction menu. I want you to help me call the calculation functions from the main. For example, if the user chooses option $1,$ then it should add a location $($a node$)$ and say how many edges it will have and their attributes, and also say with which node it will connect. For example, node $1$ will have $1$ edge connecting to node $3,$ the edge has a weight of $4$ and a time of $1.$ Below I attach at least the titles of the methods of my controller class and main $($due to lack of space I do not include them entirely$)$

public class LocationManager implements Serializable $\{$

private static final long serialVersionUID $=1760598463252095534$L;

private Edge$[][]$ matrizAdyacencia;

private List locations;

public LocationManager$($int numLocations$)\{$

matrizAdyacencia $=$ new Edge$[$numLocations$][$numLocations$]$;

locations $=$ new ArrayList$<>()$;

$\}$

public void setAdjacencyMatrix$($Edge$[][]$ matrizAdyacencia$)\{$

this.matrizAdyacencia $=$ matrizAdyacencia;

$\}$

public void getAdjacencyMatrix$($Edge$[][]$ matrizAdyacencia$)\{$

this.matrizAdyacencia $=$ matrizAdyacencia;

$\}$

public List getLocations$()\{$

return locations;

$\}$

public void setLocations$($List locations$)\{$

this.locations $=$ locations;

$\}$

public void addLocation$($Location location$)\{$

locations.add$($location$)$;

$\}$

public void editLocation$($int index, Location location$)\{$

if $($index $>=0$ && index $<$ locations.size$())\{$

locations.set$($index$,$ location$)$;

$\}$

$\}$

public void deleteLocation$($int index$)\{$

if $($index $>=0$ && index $<$ locations.size$())\{$

locations.remove$($index$)$;

for $($int i $=$ index; i $<$ locations.size$()$; i$++)\{$

for $($int j $=0$; j $<$ matrizAdyacencia.length; j$++)\{$

matrizAdyacencia$[$i$][$j$]=$ matrizAdyacencia$[$i $+1][$j$]$;

$\}$

for $($int j $=0$; j $<$ matrizAdyacencia.length; j$++)\{$

matrizAdyacencia$[$j$][$i$]=$ matrizAdyacencia$[$j$][$i $+1]$;

public void addConnection$($int source, int destination, int weight, int timeMin$)\{$

if $($source $>=0$ && source $<$ locations.size$()$ &&

destination $>=0$ && destination $<$ locations.size$())\{$

matrizAdyacencia$[$source$][$destination$]=$ new Edge$($weight$,$ timeMin$)$;

matrizAdyacencia$[$destination$][$source$]=$ new Edge$($weight$,$ timeMin$)$; $//$ Assuming undirected graph

public List shortestPathDijkstra$($int start, int end$)\{$

return shortestPathDijkstra$($start$,$ end, false$)$;

$\}$

public List shortestPathDijkstra$($int start, int end,boolean minimizeTime$)$

private int minDistance$($int$[]$ dist, boolean$[]$ visited$)\{$

return minIndex;

$\}$private List getPath$($int start, int end, int$[]$ parent$)\{$

$\}$

public void minimumSpanningTreePrim$()\{\}$

class DisjointSet $\{$

$\}$

public int find$($int x$)\{$

return parent$[$x$]$;

$\}$

public void union$($int x$,$ int y$)\{$

public void minimumSpanningTreeKruskal$()\{$

public void shortestPathFloydWarshall$()$

public void minimizeTime$()$

public void minimizeDistance$()\{$

public void mostrarMatrizAdyacencia$()\{$

$\}$public class Main implements Serializable$\{$

public static void main$($String$[]$ args$)\{$

Scanner scanner $=$ new Scanner$($System$.$in$)$;

LocationManager routeSystem $=$ new LocationManager$(3)$;

int opcion;

do $\{$

System.out.println$("-----$ Men$-----")$;

System.out.println$("1.$ Agregar ubicaci$$n$")$;$//$add ubication $($node$)$

System.out.println$("2.$ Editar ubicaci$$n$")$;$//$edit ubication $($node and its edges$)$

System.out.println$("3.$ Eliminar ubicaci$$n$")$;$//$delete node $($all it connetions$)$

System.out.println$("4.$ Calcular ruta m$$s corta $($Dijkstra$)")$;$//$apply dijkstra for find the shortespath between two nodes

System.out.println$("5.$ Encontrar $$rbol de expansi$$n m$$nima $($Prim$)")$; $//$tree of minimal expansion

System.out.println$("6.$ Encontrar $$rbol de expansi$$n m$$nima $($Kruskal$)")$;$//$same

System.out.println$("7.$ Optimizar rutas $($Floyd$-$Warshall$)")$;$//$floyd To find the shortest path between all locations.

System.out.println$("8.$ Planificar ruta $$ptima $($tiempo$)")$;$//$ to plan routes that minimize time $.$

System.out.println$("9.$ Planificar ruta $$ptima $($distancia$)$ same but with total distance