https://wiki.algo.informatik.tu-darmstadt.de/index.php?action=history&feed=atom&title=Directed_graph
Directed graph - Revision history
2026-05-01T11:08:59Z
Revision history for this page on the wiki
MediaWiki 1.38.4
https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Directed_graph&diff=2170&oldid=prev
BB91: /* Definition */
2014-11-17T20:12:48Z
<p><span dir="auto"><span class="autocomment">Definition</span></span></p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 20:12, 17 November 2014</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>==Definition==</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>==Definition==</div></td></tr>
<tr><td class="diff-marker" data-marker="−"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>A directed graph is a graph where every edge has a direction.</div></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div>A directed graph is a graph<ins style="font-weight: bold; text-decoration: none;">, </ins>where every edge has a direction<ins style="font-weight: bold; text-decoration: none;">. More precisely, a directed graph is a pair <math>G=(V,A)</math>, where <math>V</math> represents a set of nodes and <math>A</math> a set of arcs. Arcs are ordered pairs of nodes in contrast to unordered pairs of nodes (called edges) in an undirected graph. An arc <math>a = (v, w)</math> is considered to be directed '''from''' <math>v</math> '''to''' <math>w</math></ins>.</div></td></tr>
</table>
BB91
https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Directed_graph&diff=1153&oldid=prev
Bencina: Seite erstellt
2014-10-13T12:02:42Z
<p>Seite erstellt</p>
<p><b>New page</b></p><div>==Definition==<br />
A directed graph is a graph where every edge has a direction.</div>
Bencina