[create_topic]

Payload

{
  "slug": "algo-mst",
  "tags": [
    "algorithms",
    "graphs"
  ],
  "title": "Minimum spanning trees (Kruskal, Prim)",
  "summary": "MST algorithms via DSU or priority queue; cut property, cycle property — network design made tractable."
}