EDUCATIONAL WEBSITE | SPIRITUAL & SOFTWARE - INFORMATICA, UNIX, ALGO
Graph Algorithms:- Bridge / Articulation Point / Bi-Connected Components
- Strongly connected components / 2-SAT
- Euler Path / Cycle
- Logest Common Subsequence
- Network Flow
- Maximum Flow Problem
- Min Cost Flow - Maximum Matching
Geometry:
- Subroutines (2D / 3D)
- Dot products / Cross products
- Rotation
- Reflection - Intersections between
Read full article from EDUCATIONAL WEBSITE | SPIRITUAL & SOFTWARE - INFORMATICA, UNIX, ALGO
No comments:
Post a Comment