Contents:
Basic Concepts, Storage representation, Adjacency matrix,
adjacency list, adjacency multi list, inverse adjacency list. Traversals-depth first and breadth first, Introduction
to Greedy Strategy, Minimum spanning Tree, Greedy algorithms for computing minimum spanning tree-
Prims and Kruskal Algorithms, Dikjtra's Single source shortest path, Topological
ordering.
Case study- Data structure used in Webgraph and Google map.
No comments:
Post a Comment