Implement `run-many`

Tracking issue for the run-many RFC.

RFC: docs/rfcs/run-many.md (PR #387)

Summary

Add vp run-many <task1> <task2> ... that builds one execution graph containing multiple requested tasks, deduped by node. This is the schedule that today's primitives can't express:

• ["vp run a", "vp run b"] (#381) serializes the two (each vp run is its own isolated graph, items run one at a time).
• vp run --parallel only takes one task and drops every dependency edge — too blunt when some edges matter.

Combined with the string[] shorthand from #381, the tree of execution graphs gains a full algebra: string[] sequences siblings, run-many fans out within one node.

Open questions

• Which run flags are accepted by run-many (the RFC marks this TBD).
• pkg#task specifiers — included or restricted to bare task names for v1.
• Behavior when invoked with no task names (error vs. interactive multi-select).

See the RFC for the full motivation, diagrams, and a worked composition example.

Beginne mit docs/rfcs/run-many.md und dem verlinkten PR #387, um das vorgeschlagene Design des Ausführungsgraphen zu verstehen. Kläre die offenen Fragen zu den akzeptierten Flags, den pkg#task-Spezifizierern und dem Verhalten bei no-task, bevor du den Befehl implementierst. Fertig ist es, wenn vp run-many mehrere Tasks akzeptiert und einen einzigen deduplizierten Ausführungsgraphen mit dem dokumentierten Abhängigkeits- und Nebenläufigkeitsverhalten erstellt.