Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
graph, a value greater than 0 denotes a connection to another vertex with a specific weight, while 0 represents no connection. A graph representation as an adjacent matrix when using an unweighted graph. A graph representation as an adjacent matrix when using a weighted graph. An adjacency list is