C$++$ program to draw a network as a two dimensional diagram giving bad output, please help.

Code:

#include

#include

#include

#include

#include

using namespace std;

$//$ Function to validate and parse the edge input

bool parseEdges$($int n$,$ map$>$& adjList$)\{$

string edge;

for $($int i $=0$; i $$ n; $++$i$)\{$

cin $>>$ edge;

if $($edge$.$length$()!=2||$ edge$[0]==$ edge$[1]||$ edge$[0]<mtext></mtext><mi>\text{'}</mi>$A$\text{'}||$ edge$[0]>\text{'}$Z$\text{'}||$ edge$[1]<mtext></mtext><mi>\text{'}</mi>$A$\text{'}||$ edge$[1]>\text{'}$Z$\text{'})\{$

cout $$ "Invalid edge input: $"$ edge $$ endl;

return false;

$\}$

$//$ Assuming undirected graph, add edge in both directions

adjList$[$edge$[0]].$insert$($edge$[1])$;

adjList$[$edge$[1]].$insert$($edge$[0])$;

$\}$

return true;

$\}$

$//$ Function to draw the network based on the adjacency list

void drawNetwork$($const map$>$& adjList$)\{$

vector$>$ grid$(2*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+1,$ vector$(2*(\text{'}$Z$\text{'}-\text{'}$A$\text{'})+1,\text{'}\text{'}))$;

$//$ Draw horizontal edges

for $($auto& node : adjList$)\{$

char currentNode $=$ node.first;

for $($char connectedNode : node.second$)\{$

if $($currentNode $$ connectedNode$)\{$

int x $=2*($currentNode $-\text{'}$A$\text{'})$;

int y $=2*($connectedNode $-\text{'}$A$\text{'})$;

grid$[$x$][$min$($y$,$ y $+1)]=\text{'}-\text{'}$;

$\}$

$\}$

$\}$

$//$ Draw vertical edges

for $($char c $=\text{'}$A$\text{'}$; c Z$\text{'}$; $++$c$)\{$

if $($adjList$.$count$($c$)>0)\{$

int x $=2*($c $-\text{'}$A$\text{'})$;

int y $=0$;

for $($char d $=\text{'}$A$\text{'}$; d Z$\text{'}$; $++$d$)\{$

if $($c $$ d && adjList.at$($c$).$count$($d$)>0)\{$

grid$[$min$($x$,$ x $+1)][$y$]=\text{'}|\text{'}$;

$\}$

y $+=2$;

$\}$

$\}$

$\}$

$//$ Print the grid

for $($int i $=0$; i $$ grid.size$()$; $++$i$)\{$

for $($int j $=0$; j $$ grid.size$()$; $++$j$)\{$

cout $$ grid$[$i$][$j$]$;

$\}$

cout $$ endl;

$\}$

$\}$

$//$ Main function

int main$()\{$

char runAgain $=\text{'}$Y$\text{'}$;

do $\{$

int m$,$ n;

cout $$ "Nodes $[2-26]$: $"$;

cin $>>$ m;

if $($m $<mtext></mtext><mn>2</mn><mtext></mtext><mi>|</mi><mi>|</mi>$ m $>26)\{$

cout $$ "Invalid number of nodes. Please enter a value between $2$ and $26."$ endl;

continue;

$\}$

cout $$ "Edges: $"$;

cin $>>$ n;

if $($n

cout $$ "Invalid number of edges. Please enter a positive number." $$ endl;

continue;

$\}$

map$>$ adjList; $//$ Adjacency list to store the graph

cout $$ "Edge values: $"$;

if $(!$parseEdges$($n$,$ adjList$))\{$

cout $$ "Error parsing edges. Please try again." $$ endl;

continue;

$\}$

$//$ Drawing the network

cout

The network:

$"$;

drawNetwork$($adjList$)$;

$//$ Asking the user if they want to run the program again

cout

Run Again $($Y$/$N$)$: $"$;

cin $>>$ runAgain;

runAgain $=$ toupper$($runAgain$)$;

$\}$ while $($runAgain $==\text{'}$Y$\text{'})$;

return $0$;

$\}$