These notes contain examples and illustrations regarding Graph Theory. Graph Theory is an important prerequisite to understanding DSA and these notes are extremely clear and intuitive. They also include illustrations and examples
Dynammic programming is an
algorithmic
technique which identifies subproblems ,
solves
brings them
together solve the
to
them , a
larger problem
.
Greedy algorithm
chooses an
edge to a
relen that to be the closest
appears
· Dijkstra's Algorithm
Given v ,
finds the shortest path to all other
vertices
·
only works
for positive weights
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller narayani. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for £7.49. You're not tied to anything after your purchase.