File 0339-Add-wikipedia-links-to-digraph_utils.patch of Package erlang

From 96f023c656dc108c3fc6b465827b227de54dcf97 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Jos=C3=A9=20Valim?= <jose.valim@dashbit.co>
Date: Mon, 17 Mar 2025 11:22:00 +0100
Subject: [PATCH] Add wikipedia links to digraph_utils

They contain useful examples and algorithms
to make the operations easier to understand.
---
 lib/stdlib/src/digraph_utils.erl | 16 ++++++++--------
 1 file changed, 8 insertions(+), 8 deletions(-)

diff --git a/lib/stdlib/src/digraph_utils.erl b/lib/stdlib/src/digraph_utils.erl
index b2f8160204..8c88f9af38 100644
--- a/lib/stdlib/src/digraph_utils.erl
+++ b/lib/stdlib/src/digraph_utils.erl
@@ -57,18 +57,18 @@ For basic functions on directed graphs, see the `m:digraph` module.
   process is repeated.
 - A _partial ordering_{: #partial_ordering } of a set S is a transitive,
   antisymmetric, and reflexive relation between the objects of S.
-- The problem of _topological sorting_{: #topsort } is to find a total ordering
-  of S that is a superset of the partial ordering. A digraph G = (V, E) is
-  equivalent to a relation E on V (we neglect that the version of directed
-  graphs provided by the `digraph` module allows multiple edges between
-  vertices). If the digraph has no cycles of length two or more, the reflexive
-  and transitive closure of E is a partial ordering.
+- The problem of [_topological sorting_](https://en.wikipedia.org/wiki/Topological_sorting) {: #topsort }
+  is to find a total ordering of S that is a superset of the partial ordering.
+  A digraph G = (V, E) is equivalent to a relation E on V (we neglect that
+  the version of directed graphs provided by the `digraph` module allows
+  multiple edges between vertices). If the digraph has no cycles of length
+  two or more, the reflexive and transitive closure of E is a partial ordering.
 - A _subgraph_{: #subgraph } G' of G is a digraph whose vertices and edges form
   subsets of the vertices and edges of G.
 - G' is _maximal_ with respect to a property P if all other subgraphs that
   include the vertices of G' do not have property P.
-- A _strongly connected component_{: #strong_components } is a maximal subgraph
-  such that there is a path between each pair of vertices.
+- A [_strongly connected component_](https://en.wikipedia.org/wiki/Strongly_connected_component) {: #strong_components }
+  is a maximal subgraph such that there is a path between each pair of vertices
 - A _connected component_{: #components } is a maximal subgraph such that there
   is a path between each pair of vertices, considering all edges undirected.
 - An _arborescence_{: #arborescence } is an acyclic digraph with a vertex V, the
-- 
2.43.0