Explore the fundamental concepts of graph theory and network analysis in this 30-minute lecture. Delve into essential definitions, learn how to represent graphs using adjacency matrices, and master two crucial algorithms for finding minimum spanning trees: Kruskal's Algorithm and Prim's Algorithm. Gain valuable insights into the practical applications of these concepts in various fields such as computer science, data analysis, and network optimization.
Overview
Syllabus
Graphs and Networks Definitions.
Adjacency Matrices.
Kruuskal's Algorithm.
Prim's Algorithm.
Taught by
MolloyMaths
