Direct undirected edges to maintain a DAG
Filed under Sprinklr
The question
Given a mixed graph containing both directed and undirected edges, determine whether it is possible to assign directions to all undirected edges such that the resulting directed graph contains no cycles.
No write-up yet. Related questions below have one.
Related Sprinklr questions
Collected from public candidate posts and coding forums. Updated Nov 2026.