Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
represent a graph: an adjacency matrix and an adjacency list. An adjacency matrix is a method of representing a graph as either an integer or a boolean. In an unweighted graph, 0 and 1 indicate the absence or presence of a connection to another vertex, respectively. Nevertheless, in a weighted