• Students
• Fresher’s
• Working professionals.

• Problem solving techniques
  • Divide and Conquer method
  • Greedy method
  • Dynamic method
• Graph theory
  • Concept
  • Terminologies
  • Types
  • Abstract data type
  • Applications of graphs
• Graph implementation
  • Adjancency matrix
  • Adjancency list
  • Traversing graphs
• Graph basic algorithms
  • Breadth first search
  • Depth first search
  • Checking Connectedness
  • Checking Bipartite graph
  • Single source path length
  • DFS Spanning tree
  • BFS Spanning tree
• Minimum Spanning Tree algorithms
  • Kruskal's MST
  • Prim's MST
• Single source shortest path algorithms
  • Dijkstra’s algorithm
  • Bellaman ford algorithm
  • A* search algorithm
• All pair shortest path algorithms
  • Warshall-Floyd algorithm
  • Johnson’s algorithm
• Miscellaneous
  • Union Find algorithm
• Applications of graph

• Understanding of basic data structures like Stack, Queues and Linked Lists.
• Java Collections (or C++ STL or C# Collections)

• This course discusses problem solving approaches like greedy and dynamic programming in light of Graph algorithms.
• Even though technique learnt here will be useful for solving competitive problems and preparing for data structure interviews, this course is not designed to learn competitive programming nor just answer interview questions.
• It is expected that you are good in Java collections (or C++/C# collections). Teaching collection API is not expected in this course. Participants should have ability to refer documentation for the same.

• Understanding of Graph algorithms and their applications.
• Implementing graph data structure and algorithms in Java (or other language)

Learning is fun, but only if someone has a teacher like you. I learned a lot in your class because you took the extra time to explain things clearly by doing the paperwork. You gave me the extra help I needed. Thank you so much for such a wonderful session. 

There were a lot of Eureka moments during the course. Even though working in the industry for 8 years, I still feel I don't have basic concepts clear. But after the course, I think my Graph Algorithm concepts are much more sharpened and I feel a lot more comfortable solving the real world Graph problems. As usual Nilesh sir was amazing, I've been Nilesh sir's student since 2011, sir always starts from basic, like, even 10 years child would also understand the concepts and gets motivated to solve the problems by their own. Suggestion: If we could take a small problem-solving test on the algo's we learned after the course then that would great for students. This is not to give student's grade or mark, but to have a better understanding of what area they still need to improve on.

1. The lectures were very well thought of and not only covered in a proper manner but also sir went beyond the topics to covers things that students had asked for like the topological sort.

2. A lot of patience shown by sir in answering the questions and we were kept on our toes all the times as he kept the interest of ours in the topics all the time.

It was great experience learning with Nilesh sir. I have tried learning graph many times and failed every time, but the way Nilesh sir created the content,it bounds me to the whole course and I have completed the almost every expect of graph with some real life examples. Thanks you sir for such a complete Graph training.

The very helpful session, it will help me to solve not only the graph-related problems but also day to day logical problems. The dynamic programming solving approach changed your perspective when you start to deal with complex problems. Thanks, Sunbeam and Nilesh sir.