المستوى الخامس Level 5 Graph Theory ,String Algorithms , Computational Geometry
0 (0 تصنيف)
طلاب مسجلين:3
1.500,00 EGP
3.000,00 EGP
التسجيل الآن مؤقتا
-
المستوىمتوسط
-
مجموع المسجلين3
-
آخر تحديثأكتوبر 29, 2025
-
شهادةشهادة الإنجاز
أهلاً بك مرة أخرى!
1.500,00 EGP
3.000,00 EGP
التسجيل الآن مؤقتا
-
المستوىمتوسط
-
مجموع المسجلين3
-
آخر تحديثأكتوبر 29, 2025
-
شهادةشهادة الإنجاز
وصف الكورس:
محتوي الدورة
Graph Intro
-
Graph Introduction
-
Graph Represntation
-
Breadth First Search
Breadth First Search
-
Breadth First Search
Depth First Search
-
Depth First Search
Minimum Spanning Tree
-
What is a Spanning Tree?
-
Kruskal’s Algorithm
-
Prim’s Algorithm
Shortest Path Algorithms
-
Bellman Ford’s Algorithm:
-
Dijkstra’s Algorithm
-
Floyd Warshall’s algorithm
Flood-fill Algorithm
-
Flood-fill Algorithm
Articulation Points and Bridges
-
Articulation Points and Bridges
Biconnected Components
-
Biconnected Components
Strongly Connected Components
-
Strongly Connected Components
Topological Sort
-
Topological Sort
Hamiltonian Path
-
Hamiltonian Path
Maximum flow
-
Ford-Fulkerson Algorithm
-
Dinic’s Algorithm
-
Maximum flow
Minimum Cost Maximum Flow
-
Cycle Cancelling Algorithm:
-
Hungarian Algorithm
Min-cut
-
Min-cut
Aizu Graph Problems
-
Shortest Path 3 problems
-
Spanning Tree 3 problems
-
Connected Components 3 problems
-
Path/Cycle 2 problems
-
Tree 5 problems
-
Network Flow 2 problems
-
Matching 1 problem
Graph General LeetCode
-
Number of Islands
-
Surrounded Regions
-
Clone Graph
-
Evaluate Division
-
Course Schedule
-
Course Schedule II
Graph Bfs LeetCode
-
Snakes and Ladders
-
Minimum Genetic Mutation
-
Word Ladder
String algorithms
-
String terminology
-
Trie structure
-
String hashing
-
Z-algorithm
Aizu 4 String Problems
-
String Search 4 problems
Computational Geometry
-
Points/Vectors
-
Segments/Lines
-
Polygon
-
Convex Polygon
-
Point Set
-
Segment Set
-
Circle
Sweep line algorithms
-
Intersection points
-
Closest pair problem
-
Convex hull problem
تقييمات الطلاب
أي مراجعة بعد