Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
a way to represent vertices in an array, where each array element has a linked list to its neighbors. In an unweighted graph, the linked lists do not have any weight defined in the white square. Conversely, in a weighted graph, a weight is defined inside each node of the linked lists. A graph