Description
Graph Theory Algorithms is a complete training course on graph theory algorithms in computer science and mathematics. In this video tutorial, you will learn many things: how to store and display graphs on a computer, getting to know the common problems of graph theory, famous traversal algorithms (DFS and BFS), Dijkstra’s algorithm for finding the shortest path, what is order Based on topology, what are negative detection cycles and finding the shortest path with Bellman-Ford and Floyd-Warshall algorithms.
What you will learn in the Graph Theory Algorithms course:
- Memory and display of graphs in a computer
- Common problems of graph theory
- First row and depth search algorithm
- Different algorithm trees include: height or tree, finding the center of the tree, finding the root of the tree and…
- Dijkstra’s algorithm
- Algorithm to arrange location
- The shortest and longest path in an acyclic graph
- Bellman Ford algorithm
- Floyd-Warshall algorithm
- Find bridge/joint points
- Finding Tightly Connected Components (Tarjan’s)
- Seller Movement Issues (TSP)
- How to find the maximum flow of a flow graph
- Finding matching of bipartite graphs
- Different network flow algorithms include: Edmonds-Karp, Capacity Scaling and Dinic
- Kruskal’s algorithm
- The Lowest Common Ancestor Problem
Course details
Publisher: Udemy
Instructors: William Fiset
English language
Training level: introductory to advanced
Number of courses: 46
Duration: 9 hours and 2 minutes
Course topics:
Course prerequisites:
Exposure to computer science fundamentals (eg: data structures, recursion, classes, OOP)
Pictures
Sample video
Installation guide
After Extract, view with your favorite Player.
English subtitle
Quality: 720p
download link
Password file(s): www.downloadly.ir
Size
2.6 GB
Be the first to comment