Please correct my code where is it wrong:

#include

#include

#include

#include

#include

#define MAX$\_$NODES $100$

#define NAME$\_$MAX $100$

typedef struct $\{$

char Node$1[$NAME$\_$MAX$]$;

char Node$2[$NAME$\_$MAX$]$;

int load;

$\}$ Links;

typedef struct $\{$

Links links$[$MAX$\_$NODES$]$;

int num$\_$links;

$\}$ Diagram;

void InsertNewDiagram$($Diagram $*$diagram$)$;

void saveNew$($Diagram $*$diagram$)$;

void SelectDiagram$()$;

void ShortPath$($Diagram $*$diagram$)$;

int main$()\{$

int options;

Diagram diagram;

diagram.num$\_$links $=0$;

do $\{$

printf$("$

Menu Options:

$")$;

printf$("$Option $1$: Insert a new graph.

$")$;

printf$("$Option $2$: Choose a graph from the CSV files to activate.

$")$;

printf$("$Option $3$: Find the shortest path of the active graph.

$")$;

printf$("$Option $4$: Exit the program.

$")$;

printf$("$

Provide the option you want to choose: $")$;

scanf$("\%$d$",$ &options$)$;

switch $($options$)\{$

case $1$:

InsertNewDiagram$($&diagram$)$;

break;

case $2$:

SelectDiagram$()$;

break;

case $3$:

if $($diagram$.$num$\_$links $==0)\{$

printf$("$No Graph selected. Firstly select a Graph.

$")$;

$\}$ else $\{$

ShortPath$($&diagram$)$;

$\}$

break;

case $4$:

printf$("$Leave the program.

$")$;

break;

default:

printf$("$Incorrect option chosen. Retry.

$")$;

$\}$

$\}$ while $($options $!=4)$;

return $0$;

$\}$

$//$Option $1$

void InsertNewDiagram$($Diagram $*$diagram$)\{$

char Node$1[$NAME$\_$MAX$],$ Node$2[$NAME$\_$MAX$]$;

int load, num$\_$links;

printf$("$Provide the amount of Edges the graph has: $")$;

scanf$("\%$d$",$ &num$\_$links$)$;

diagram$->$num$\_$links $=$ num$\_$links;

printf$("$Provide the vertices in capital letters and weight:

$")$;

printf$("($Vertex$1,$Vertex$2,$Weight$)$

$")$;

for $($int i $=0$; i $<$ num$\_$links; i$++)\{$

scanf$("\%$s$,\%$s$,\%$d$",$ Node$1,$ Node$2,$ &load$)$;

strcpy$($diagram$->$links$[$i$].$Node$1,$ Node$1)$;

strcpy$($diagram$->$links$[$i$].$Node$2,$ Node$2)$;

diagram$->$links$[$i$].$load $=$ load;

$\}$

saveNew$($diagram$)$;

$\}$

void saveNew$($Diagram $*$diagram$)\{$

char Name$[$NAME$\_$MAX$]$;

FILE $*$fp;

printf$("$Provide the name you want to save the graph to: $")$;

scanf$("\%$s$",$ Name$)$;

fp $=$ fopen$($Name$,"$w$")$;

if $($fp $==$ NULL$)\{$

printf$("$The file cannot be opened

$")$;

return;

$\}$

for $($int i $=0$; i $<$ diagram$->$num$\_$links; i$++)\{$

fprintf$($fp$,"\%$s$,\%$s$,\%$d

$",$ diagram$->$links$[$i$].$Node$1,$ diagram$->$links$[$i$].$Node$2,$ diagram$->$links$[$i$].$load$)$;

$\}$

fclose$($fp$)$;

printf$("$The Graph is saved under $\%$s

$",$ Name$)$;

$\}$

$//$Option $2$

void SelectDiagram$()\{$

DIR $*$dir;

struct dirent $*$entry;

char rentName$[$NAME$\_$MAX$]$;

printf$("$Provide the path to the location of the CSV files: $")$;

scanf$("\%$s$",$ rentName$)$;

if $(($dir $=$ opendir$($rentName$))!=$ NULL$)\{$

int compute $=0$;

char files$[100][$NAME$\_$MAX$]$;

while $(($entry $=$ readdir$($dir$))!=$ NULL$)\{$

if $($strstr$($entry$->$d$\_$name, $".$csv$")!=$ NULL$)\{$

strcpy$($files$[$compute$],$ entry$->$d$\_$name$)$;

compute$++$;

$\}$

$\}$

closedir$($dir$)$;

if $($compute $==0)\{$

printf$("$There are no CSV files available to use.

$")$;

return;

$\}$

printf$("$The available CSV files:

$")$;

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

printf$("\%$d$.\%$s

$",$ i $+1,$ files$[$i$])$;

$\}$

int choose;

printf$("$Provide the number of the file to be added: $")$;

scanf$("\%$d$",$ &choose$)$;

if $($choose $<1||$ choose $>$ compute$)\{$

printf$("$Incorrect option chosen.

$")$;

return;

$\}$

printf$("$The option you chose is: $\%$s$.$

$",$ files$[$choose $-1])$;

$\}$ else $\{$

perror$("$Error in openening directory."$)$;

$\}$

$\}$

$//$finding index of vertices

int discoverIND$($char $*$apex$,$ Diagram $*$diagram$)\{$

for $($int j $=0$; j $<$ diagram$->$num$\_$links; j$++)\{$

if $($strcmp$($diagram$->$links$[$j$].$Node$1,$ apex$)==0||$ strcmp$($diagram$->$links$[$j$].$Node$2,$ apex$)==0)\{$

return j;

$\}$

$\}$

return $-1$;

$\}$

$//$Dijkstra

void Dijkstra$($Diagram $*$diagram$,$ char $*$begin$,$ char $*$fin$)\{$

int c $=$ diagram$->$num$\_$links;

int span$[$MAX$\_$NODES$]$;

int before$[$MAX$\_$NODES$]$;

int marked$[$MAX$\_$NODES$]$;

for $($int k $=0$; k $<$ c; k$++)\{$

span$[$k$]=$ INT$\_$MAX;

before$[$k$]=-1$;

marked$[$k$]=0$; $//$ Initialize marked array with zeroes

$\}$

int beginIND $=$ discoverIND$($begin$,$ diagram$)$;

int finIND $=$ discoverIND$($fin$,$ diagram$)$;

if $($beginIND $==-1||$ finIND $==-1)\{$

printf$("$Unable to find the startpoint or endpoint of the vertex given in Graph.

$")$;

return;

$\}$

span$[$beginIND$]=0$;

$//$The algorithm itself

for $($int sum $=0$; sum $<$ c $-1$; sum$++)\{$

int shortestSpan $=$ INT$\_$MAX;

int shortestIND $=-1$;