commit 607112bd10b493ab431a5febddbfb1275a37d078
parent 18c19fc5c9a8caf2bce7fff5bf8727149667ac83
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Tue, 7 Apr 2026 11:10:56 +0200
commit with codex
Diffstat:
2 files changed, 14 insertions(+), 5 deletions(-)
diff --git a/topological_order b/topological_order
@@ -0,0 +1,9 @@
+# Topological order
+
+A [total_order] on the [vertices] of a [DAG] such that whenever u has a path to v then u comes before v in the order
+
+- [topological_sorting]
+
+Up: [order], [DAG]
+
+Aliases: topological ordering, topological orderings
diff --git a/topological_sorting b/topological_sorting
@@ -1,14 +1,14 @@
# Topological sorting
-Problem on [directed_graphs]: find a [total_order] on the graph vertices such that whenever u has a path to v then u comes before v in the order
-- only possible, as stated, when the graph is a [DAG]
-
https://en.wikipedia.org/wiki/Topological_sorting
+[Computational_problem] on [directed_graphs] of finding a [topological_order]
+- only possible, as stated, when the graph is a [DAG]
+
- [constrained_topological_sorting]
Up: [graph_algorithm], [directed_acyclic_graph]
-See also: [strongly_connected_component_algorithm], [linear_extension]
+See also: [strongly_connected_component_algorithm], [linear_extension], [topological_order], [topology], [Topological_minor]
-Aliases: topological sort, topological ordering, topological orderings
+Aliases: topological sort
