DIJKSTRA'S ALGORITHM | SHORTEST PATH ALGORITHM | GRAPH THEORY | DISCRETE MATHEMATICS

Описание

To find the shortest paths between any two vertices in the given graph, we use Dijkstra’s algorithm, which is very similar to Prim’s algorithm for minimum spanning tree. Like Prim’s MST, we generate a SPT (shortest path tree) with a given source as a root. We maintain two sets, one set contains vertices included in the shortest-path tree, other set includes vertices not yet included in the shortest-path tree. At every step of the algorithm, we find a vertex that is in the other set (set of not yet included) and has a minimum distance from the source.


Course : Discrete Mathematics
Semester : V
B.Sc (H) Mathematics
University of Delhi

Understand the notion of ordered sets and maps between ordered sets. Learn about lattices, modular and distributive lattices, sublattices and
homomorphisms between lattices. Become familiar with Boolean algebra, Boolean homomorphism, Karnaugh diagrams, switching circuits and their applications. Learn about basics of graph theory, including Eulerian graphs, Hamiltonian graphs. Learn about the applications of graph theory in the study of shortest path algorithms.

#discretemathematics #discretemathematicsanditsapplications #discretemathematicsstructure2 #discretemathematicsquiz #graphtheory #graphtheoryandcombinatorialtopology #graphtheorynotes #graphtheoryrules #graphtheorydiscretemathematics #graphtheoryassignment #graphtheoryexercise #graphtheorygirl #graphtheoryproblem #graphtheorysolutions #graphtheorysolver #graphtheorytutoring #graphtheory #mathematics #math #science #computerscience #mathematical #mathfacts #mathteacher #mathstudent #studying #studygram #sciencenews #quanta #mathematicalart #programming #ilovemath #visualfodder #informationtechnology #knowledgegate #it #discretemaths #graphs #programmerslife #aptitude #numericalaptitude #computerengineeringstudent #computers #cselovers #gatecomputerscience #bhfyp