Implement core graph algorithms for graphics

Q: Implement core graph algorithms for graphics

This is a Coding & Algorithms interview question from NVIDIA for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Given a scene or dependency graph, implement topological sort, BFS/DFS, and shortest path (Dijkstra). Discuss time/space complexity, memory layouts (CSR vs adjacency lists), and how you would parallelize traversals on CPU vs GPU while avoiding contention and ensuring determinism in a test framework.

Implement core graph algorithms for graphics

Comments (0)