data structures using as for verticesthere is related concept for edges an edge in graph is called bridge if removing that edge results in disconnected graph alsoan edge in graph that does not lie on cycle is figure bi-connected figure graph with bridge this means that bridge has at least one bridges graph articulation point at its endalthough it is not necessary that the articulation point is linked to bridge look at the graph shown in fig in the graphcd and de are bridges consider some more examples shown in fig (cd is bridge(there are no bridgesa representation of graphs there are three common ways of storing graphs in the computer' memory they aresequential representation by using an adjacency figure graph with bridges matrix linked representation by using an adjacency list that stores the neighbours of node using linked list adjacency multi-list which is an extension of linked representation in this sectionwe will discuss both these schemes in detail (cd is bridge(all edges are bridgesadjacency matrix representation an adjacency matrix is used to represent which nodes are adjacent to one another by definitiontwo nodes are said to be adjacent if there is an edge connecting them in directed graph gif node is adjacent to node uthen there is definitely an edge from to that isif is adjacent to uwe can get from to by traversing one edge for any graph having nodesthe adjacency matrix will have the dimension of yn in an adjacency matrixthe rows and columns are labelled by graph vertices an entry aij in the adjacency matrix will contain if vertices vi and vj are adjacent to each other howeverif the nodes are not adjacentaij will be set to zero it is summarized in fig since an adjacency matrix contains only and sit is [if vi is adjacent to vjthat is called bit matrix or boolean matrix the entries in the aij there is an edge (vivj)] matrix depend on the ordering of the nodes in therefore [otherwisea change in the order of nodes will result in different adjacency matrix figure shows some graphs and their corresponding adjacency matrices figure adjacency matrix entry bcde (adirected graph bcde (cundirected graph bcd (bdirected graph with loop bcde (dweighted graph figure graphs and their corresponding adjacency matrices