@luknits.id: Hijab friendly dan whitenya ga tembus sama sekali🙆🏻‍♀️🫶🏻🧶

Luknits.id
Luknits.id
Open In TikTok:
Region: ID
Saturday 10 October 2026 01:58:26 GMT
2060
11
0
1

Music

Download

Comments

There are no more comments for this video.
To see more videos from user @luknits.id, please go to the Tikwm homepage.

Other Videos

Dijkstra's Algorithm in 25 seconds — code and graph moving together. 🟡 The idea is simple: always expand the closest unvisited node first. Keep a running
Dijkstra's Algorithm in 25 seconds — code and graph moving together. 🟡 The idea is simple: always expand the closest unvisited node first. Keep a running "cheapest cost to reach you" for every node, pull the smallest off a min-heap, and relax its neighbors. When the target pops, you're done — and the number you popped is the shortest distance. Watch the reel and follow the highlighted code line as it moves with the diagram: pop a node (it glows), relax its edges (they flash blue), lock in the distance (it turns green). A settles at 0, the frontier spreads — B(3), D(4), C(5), G(6), F(7) — until H locks in at 9. Then the gold trail lights up the actual cheapest route: A → D → G → F → H = 9. Not the fewest hops. The lowest total weight. Where it actually runs (it's not just an interview problem): → Google Maps & GPS — fastest route, recalculated live → Internet routing — OSPF picks the path your packets take → Flights & transit — cheapest / fastest itinerary search → Game AI — enemies pathfinding across a map → Logistics — delivery and supply-chain routing The AI-engineer angle: when a model writes Dijkstra for you, the bugs hide in the details. Does it break the moment the target pops, or waste time finishing the whole graph? Does it skip stale heap entries? Does it quietly accept a negative edge weight — where Dijkstra is simply the wrong tool and you need Bellman-Ford? Knowing the pattern is how you catch the machine being confidently wrong. Heap or Binary Search next? #HackProduct #codevisuals #coding #visuals #algorithms

About