Thinkycap logo
Worksheets

Graph Algorithms

Master of Engineering (MEng) · University · Computer Science

This unit provides a comprehensive introduction to graph theory, covering fundamental concepts, algorithms, and their applications. Students will develop a solid understanding of graph representation, traversal techniques, shortest path algorithms, and minimum spanning tree algorithms.

Coming soonPractice questions for this topic are coming soonUntil then, you can already practice other topics.Browse topics

What's included

  • Graph Representation: Adjacency list
  • adjacency matrix
  • incidence matrix
  • Traversal Techniques: Depth-first search
  • breadth-first search
  • Shortest Path Algorithms: Dijkstra's algorithm
  • Bellman-Ford algorithm
  • Floyd-Warshall algorithm
  • Minimum Spanning Tree Algorithms: Kruskal's algorithm
  • Prim's algorithm
  • Graph Applications: Social networks
  • routing

Keywords

  • Graph Representation
  • Traversal Techniques
  • Shortest Path Algorithms
  • Minimum Spanning Tree Algorithms
  • Graph Applications