Data Structure Algorithm, Programming, Dijkstras Algorithm, Bellman Ford Algorithm, Graph.
classifications by weights and directions and different graph representations. Graph Classification by the weights There are two types of graphs based on the weights assigned to their edges. An unweighted graph, denoted as G(V, E), is a graph in which the edges do not have any associated weights.