for( = ; < ; ++if( [ ][ < [ ][kq[ ][ ] [ ][jq[ ][ ]else [ ][jq[ ][kq[ ][ ]printf("\ \ ")display(qn)getch()return void read(int mat[ ][ ]int nint ijfor( = ; < ; ++for( = ; < ; ++printf("\ mat[% ][% "ij)scanf("% "&mat[ ][ ])void display(int mat[ ][ ]int nint ijfor( = ; < ; ++{printf("\ ")for( = ; < ; ++printf("% \ "mat[ ][ ])output applications of graphs graphs are constructed for various types of applications such asin circuit networks where points of connection are drawn as vertices and component wires become the edges of the graph in transport networks where stations are drawn as vertices and routes become the edges of the graph in maps that draw cities/states/regions as vertices and adjacency relations as edges in program flow analysis where procedures or modules are treated as vertices and calls to these procedures are drawn as edges of the graph once we have graph of particular conceptthey can be easily used for finding shortest pathsproject planningetc in flowcharts or control-flow graphsthe statements and conditions in program are represented as nodes and the flow of control is represented by the edges