I tried to find an answer for these two respective functions for DFS and BFS$,$ but to no avail. DFS requires a Stack $($non$-$recursive$)$ while BFS uses Queue. Do you have an answer for these two functions? Here's the code I have so far:

Complete the required methods and write your name in main method

$//$ CSUN Spring $24$ COMP$469$ Hwk$-2$

$//$ DFS and BFS Search in Graph

$//$ Author: Roman Brown

import java.io$.*$;

import java.util.$*$;

public class brownH$2\{$

$//$class variables

$//$use prt for System.out to save typing

PrintStream prt $=$ System.out;

$//$Print Graph Matrix

private void prtGraph$($int g$[][],$ int n$)\{$

int i$,$ j$,$ k;

$//$ Print Graph matrix

prt$.$printf$("\backslash$t$\backslash$tGraph Matrix is as follows$\backslash$t $")$;

for $($k $=1$; k n; k$++)$

prt$.$printf$("\%4$d$|",$ k$)$;

$//$end for

prt$.$printf$("\backslash$t $")$;

for $($k $=1$; k n; k$++)$

prt$.$printf$("-----")$;

$//$end for

prt$.$printf$("\backslash$t$")$;

for $($i $=1$; i n; i$++)\{$

prt$.$printf$("\%2$d$|",$ i$)$;

for $($j $=1$; j n; j$++)$

prt$.$printf$("\%4$d$|",$ g$[$i$][$j$])$;

$//$end inner for

prt$.$printf$("\backslash$t$")$;

$\}//$ end outer for

$\}//$ end prtm

$//$Non recursive DFS for node j from node i

private void dfs$($int g$[][],$ int n$,$ int i$,$ int j$)\{//$Finish $1$st method

prt$.$printf$("\backslash$tDFS for node $\%$d from node $\%$d:$",$ j$,$ i$)$;

$//$complete this method by using stack $($non recursive$)$

$\}//$ end DFS from start to goal

$//$ BFS for node j from node i

private void bfs$($int g$[][],$ int n$,$ int i$,$ int j$)\{//$Finish $2$nd method

prt$.$printf$("\backslash$tBFS for node $\%$d from node $\%$d:$",$ j$,$ i$)$;

$//$complete this method by using Queue

$\}//$ end BFS

private void process$($String args$[])\{$

prt$.$printf$("\backslash$tThis method reads weighted graph info from inputfile"$+$

$"\backslash$tand uses adjacency matrix for graph representation."$+$

$"\backslash$tNext reads no$.$ of bfs and dfs searches from"$+$

$"$ i to j$.")$;

$//$ Method local variables

int i$,$ j$,$ k$,$ wt$,$ srch;

int g$[][],$ n$,$ edges;$//$no$.$ of nodes and edges;

long start, end;

int cnt $=$ args.length; $//$ get no$.$ of arguments

String fname;

if $($cnt $<mtext\; id="EditorElement\_13579867"></mtext><mn\; id="EditorElement\_13579868">1</mn><mi\; id="EditorElement\_13579869">)</mi><mi\; id="EditorElement\_13579870">\{</mi>$

System.out.printf$("\backslash$tOOOPS Invalid No$.$ of aguments!"$+$

$"\backslash$tTO Execute: java xxxxxH$2$ inputfilename"$)$;

return;

$\}//$ end if

$//$ get input file name

fname $=$ args$[0]$;

try$\{//$ open input file

Scanner inf $=$ new Scanner$($new File$($fname$))$;

n $=$ inf.nextInt$()$;$//$read no$.$ of nodes

edges $=$ inf.nextInt$()$;$//$read no$.$ of edges

$//$Allocate space for graph

g $=$ new int$[$n$+1][$n$+1]$;

$//$ initialize graph matrix

for $($i $=1$; i n; i$++)$

for $($j $=1$; j n; j$++)$

g$[$i$][$j$]=0$;

$//$ read graph data

for $($k $=1$; k edges; k$++)\{$

i $=$ inf.nextInt$()$;

j $=$ inf.nextInt$()$;

wt $=$ inf.nextInt$()$;

g$[$i$][$j$]=$ g$[$j$][$i$]=$ wt;$//$undirected graph

$\}//$ end for

$//$ Print graph

prtGraph$($g$,$ n$)$;

$//$read no$.$ of searches

srch $=$ inf.nextInt$()$;

$//$Get System Time

start $=$ System.currentTimeMillis$()$;

for $($k $=1$; k srch; k$++)\{$

i $=$ inf.nextInt$()$;

j $=$ inf.nextInt$()$;

prt$.$printf$("\backslash$tSearch from $\%$d for $\%$d$",$ i$,$ j$)$;

dfs$($g$,$ n$,$ i$,$ j$)$;

bfs$($g$,$ n$,$ i$,$ j$)$;

$\}//$ end for

$//$Get System Time

end $=$ System.currentTimeMillis$()$;

prt$.$printf$("\backslash$tExec Time: $\%$d ms$",$ end $-$ start$)$;

$//$ close input file

inf.close$()$;

$\}$catch$($IOException e$)\{$prt$.$printf$("$I$/$O Error $\%$s$",$ e $)$;

$\}$

$\}//$ end process method

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

System.out.printf$("\backslash$tDFS and BFS Search in Graph:"$+$

$"\backslash$t$\backslash$tTo compile: javac xxxxxH$2.$java" $+$

$"\backslash$t$\backslash$tTo execute: java xxxxxH$2$ inputfilename"$)$;

$//$ create an instance of xxxxxH$2$ class

brownH$2$ g $=$ new brownH$2()$;

$//$ call process method

g$.$process$($args$)$;

$//$Write your name in next line$1$

System.out.printf$("\backslash$tAuthor: Roman Brown Date: $\%$s$",$ java.time.LocalDate.now$())$;

$\}//$ end main

$\}//$ end xxxxxH$2$

$/*$graph info: Chapter $3,$ figure $3\mathrm{.}9$ with $3$ searches from node i to j

$510$

$12100$

$13125$

$14100$

$1575$

$2350$

$2475$

$25125$

$34100$

$35125$

$4550$

$3$

$15$

$25$

$51$