Weighted Graph
There's a total of 2 articles.
Single Source Shortest Path (SSSP) in a graph
graph theory
single source shortest path
weighted graph
unweighted graph
dijkstra
bfs
set
priority queue
Given a weighted graph $G$ with $V$ vertices and $E$ edges where all the weights are non-negative and given a source vertex $s$, the single source shortest path problem consists in finding the distance from $s$ to all the other vertices.
In this article I describe the problem in a weighted and unweighted graph as well as implementations using BFS for unweighted graphs and Dijkstra's algorithm for weighted graphs using an array and a priority queue.
Introduction to Graph Theory
graph theory
directed graph
undirected graph
complete graph
dense graph
sparse graph
complement graph
bipartite graph
k-partite graph
biconnected graph
multigraphs
pseudographs
weighted graph
digraphs
degree
Graph Theory has numerous applications in real life, it can be used in problems found in social networks, transportation networks, the internet, chemistry, computer sciense, electrical networks among others.
In general, any problem that involves relationships between objects can be modeled as a graph.