Algowiki - User contributions [en]

Category:Minimal Spanning Tree

2014-11-07T15:49:38Z

Flomm: /* Output */

== Introduction ==

[[File:min_span_tree.jpg|400px]]

The red colored edges are the minimal spanning tree of this graph.

== Input ==

* A undirected connected graph <math>G=(V,E)</math>
* A weight <math>w(u,v)</math> for each edge <math>(u,v) \in E</math>

== Output ==

A acylic subset <math>T \subseteq E</math> in which <math>w(T) = \sum_{(u,v) \in T} w(u,v)</math> is minimal.

== Generic algorihm ==

<code>
Generic-MST(G, w)
1 ''A'' ← ∅
2 '''while''' ''A'' is not a spanning tree
3 '''do''' determine a edge ''(u,v)''
4 ''A'' ← ''A'' ∪ ''{(u,v)}''
5 '''return''' ''A''
</code>

== Known algorithms ==

* [[Kruskal]]
* [[Prim]]

Category:Minimal Spanning Tree

2014-11-07T15:47:44Z

Flomm: Created page with "== Introduction == 400px The red colored edges are the minimal spanning tree of this graph. == Input == * A undirected connected graph <math>G=(..."

== Introduction ==

[[File:min_span_tree.jpg|400px]]

The red colored edges are the minimal spanning tree of this graph.

== Input ==

* A undirected connected graph <math>G=(V,E)</math>
* A weight <math>w(u,v)</math> for each edge <math>(u,v) \in E</math>

== Output ==

A acylic subset <math>T \subset E</math> in which <math>w(T) = \sum_{(u,v) \in T} w(u,v)</math> is minimal.

== Generic algorihm ==

<code>
Generic-MST(G, w)
1 ''A'' ← ∅
2 '''while''' ''A'' is not a spanning tree
3 '''do''' determine a edge ''(u,v)''
4 ''A'' ← ''A'' ∪ ''{(u,v)}''
5 '''return''' ''A''
</code>

== Known algorithms ==

* [[Kruskal]]
* [[Prim]]

File:Min span tree.jpg

2014-11-07T15:36:04Z

Flomm:

Strongly connected components

2014-11-04T15:23:01Z

Flomm:

== Input ==

A [[Basic graph definitions|directed graph]] <math>G=(V,A)</math>.

== Output ==

A set of sets of nodes. Each set of nodes contains exactly the nodes of one [[Basic graph definitions#Connectedness|SCC]]. The correspondence between the [[Basic graph definitions#Connectedness|SCC]] and these sets of nodes is one-to-one.

== Known algorithms ==

# [[Kosaraju]]

Depth-first search

2014-10-30T14:13:28Z

Flomm: Added stack implementation pseudocode

[[Category:Algorithms]]
[[Category:Search Algorithms]]
[[Category:Tree Algorithms]]
[[Category:Graph Traversal]]

== General information ==

'''Algorithmic problem:''' [[Graph traversal]]

'''Type of algorithm:''' loop

== Abstract view ==

'''Definitions:'''
# For each node, an arbitrary but fixed ordering of the outgoing arcs is assumed. An arc <math>(v,w)</math> preceding an arc <math>(v,w')</math> in this ordering is called '''lexicographically smaller''' than <math>(v,w)</math>.
# Let <math>p</math> and <math>p'</math> be two paths that start from the same node <math>v\in V</math>, but may or may not have the same endnode. Let <math>w</math> be the last common node such that the subpaths of <math>p</math> and <math>p'</math> from <math>v</math> up to <math>w</math> are identical (possibly <math>v=w</math>). If the next arc of <math>p</math> is lexicographically smaller than the next arc of <math>p'</math>, <math>p</math> is said to be '''lexicograpically smaller''' than <math>p'</math>.
# Note that the lexicographically smallest path from <math>v\in V</math> to <math>w\in V</math> is well defined and unique. With respect to a starting node <math>s\in V</math>, a node <math>v\in V</math> is '''lexicographically smaller''' than <math>w\in V</math> if the lexicographically smallest path from <math>s</math> to <math>v</math> is lexicographically smaller than the lexicographically smallest path from <math>s</math> to <math>w</math>.
# In all of the above cases, the reverse relation is called '''lexicographically larger'''.
# A node <math>v\in V</math> is '''lexicographically smaller''' (resp., '''lexicograpically larger''') than a path <math>p</math> if the lexicographically smallest path from the start node of <math>p</math> to <math>v</math> is lexicographically smaller (resp., larger) than <math>p</math>. (Note the asymmetry: In both cases, the lexicographically ''smallest'' path to <math>v</math> is used.)
# In all cases, we also say '''precedes''' and '''succeeds''', respectively, instead of "is lexicograpically smaller/larger".

'''Additional output:'''
# Each node has two Boolean labels with semantics, "is seen" and "is finished".
# An arborescence <math>A=(V',A')</math> rooted at <math>s</math> such that <math>V'\subseteq V</math> is the set of all nodes reachable from <math>s</math> (including <math>s</math>). For each node <math>v\in V'</math>, the path in <math>A</math> is the lexicographically smallest <math>(s,v)</math>-path in <math>G</math>.

'''Specific characteristic:'''
The nodes may be returned either in lexicographic order or (alternatively or simultaneously) in an order that fulfills the following property:
Let <math>v,w\in V</math> such that <math>v</math> is seen before <math>w</math>. If there is a path from <math>v</math> to <math>w</math>, <math>w</math> is finished prior to <math>v</math>.

'''Auxiliary data:'''
# A stack <math>S</math> whose elements are nodes in <math>V</math>.
# Each node has a '''current arc''' <math>a_v\in V</math>, which is either void or an outgoing arc <math>a_v=(v,w)</math> of <math>v</math>.

'''Invariant:'''
Before and after each iteration:
# <math>S</math> forms a path <math>p</math> from the start node <math>s</math> to some other node, that is, the order of the nodes on <math>p</math> is the order in which they appear in <math>S</math> (start node <math>s</math> at the bottom of <math>S</math>).
# For each node not yet seen, the current arc is the first arc (or void if the node has no outgoing arcs).
# For each node <math>v</math> on <math>p</math>:
## If there are arcs <math>(v,w)\in A</math> such that <math>w</math> is not yet seen, the current arc equals or precedes the first such arc.
## The subpath of <math>p</math> from the start node <math>s</math> to <math>v</math> is the lexicographically first <math>(s,v)</math>-path.
# The nodes on <math>p</math> are seen but not finished. Let <math>p+a</math> denote the concatenation of <math>p</math> with the current arc <math>a</math> of the last node of <math>p</math>. The nodes that are lexicographically smaller than <math>p+a</math> are seen and finished, and the nodes that lexicographically succeed <math>p+a</math> are neither seen nor finished. (Note that nothing is said about the head of <math>a</math>).

'''Variant:''' Either one node is finished or the current arc of one node is moved forward.

'''Break condition:''' <math>S=\emptyset</math>.

== Induction basis ==

'''Abstract view:''' No node is finished. The start node <math>s</math> is seen, no other node is seen. The start node is the only element of <math>S</math>. The current arc of each node is its first outgoing arc. If the nodes are to be returned in lexicographic order, the start node <math></math> is, initially, the only member of the output sequence; otherwise, the initial output sequence is empty. Arborescence <math>A</math> is initialized so as to contain <math>s</math> and nothing else.

'''Implementation:''' Obvious.

'''Proof:''' Obvious.

== Induction step ==

'''Abstract view:'''
# Let <math>v</math> be the last node of <math>p</math> (=the top element of <math>S</math>).
# While the current arc of <math>v</math> is not void and while the head of the current arc is labeled as seen: Move the current arc one step forward.
# If the current arc of <math>v</math> is not void, say, <math>a_v=(v,w)</math>:
## Insert <math>w</math> and <math>(v,w)</math> in <math>A</math>.
## Push <math>w</math> on <math>S</math>.
## Label <math>w</math> as seen.
## If the output order is the lexicographic one: Append <math>v</math> to the output sequence.
# Otherwise:
## Remove <math>v</math> from <math>S</math>
## Label <math>v</math> as finished.
## If the output order is '''not''' the lexicographic one: Put <math>v</math> in the output sequence.

'''Implementation:''' Obvious.

'''Proof:'''
The loop ''variant'' is obviously fulfilled.

The first point of the ''invariant'' is obviously fulfilled, too. The second point follows from the fact that the current arc of a node is initialized to be the node's very first outgoing arc and only changed after the node is labeled as ''seen''. Point 3.1 follows from the fact that the current arc never skips an arc that points to an unseen node.

For point 3.2, let <math>w\neq v</math> be the last node on <math>p</math> and <math>p'</math> such that both paths are identical from <math>s</math> to <math>w</math> (possibly, <math>w=s</math>). Further, let <math>u</math> and <math>u'</math> be the immediate successors of <math>w</math> on <math>p</math> and <math>p'</math>, respectively. Then <math>u'</math> has been seen before <math>u</math>. Note that <math>v</math> has not been seen earlier than <math>u</math> (in fact, later, unless <math>v=u</math>). In summary, <math>u'</math> has been seen before <math>v</math>. Since there is a path from <math>u'</math> to <math>v</math>, the correctness proof [[#Correctness|below]] will prove point 3.2.

When a node is pushed on <math>S</math>, it is neither seen nor finished immediately before that iteration and then labeled as seen in that iteration. The node is finished when it leaves <math>S</math>. Both facts together give the first sentence of point 4. The other statements of point 4 follow from the observation that the concatenation of <math>p</math> with the current arc of the endnode of <math>p</math> increases lexicographically in each iteration.

== Correctness ==

It is easy to see that each operation of the algorithm is well defined. Due to the variant, the loop terminates after a finite number of steps. Immediately before the last iteration, <math>p</math> consists of the start node <math>s</math> only, and the current arc of <math>s</math> is void. Therefore, ''all'' nodes reachable from <math>s</math> except for <math>s</math> itself are lexicographically smaller than <math>p</math> at that moment. Due to point 4 of the invariant, all of these nodes are finished. In the last iteration, <math>s</math> is finished as well.

So, it remains to show that the specific characteristic is fulfilled in both cases.
Due to point 3.2 of the invariant, a node is seen for the first time via its lexicographically smallest path from <math>s</math>. Since the current path increases lexicographically in each iteration, the nodes are labeled as seen in lexicographic order. So consider the second, the non-lexicographic case.
Let <math>v</math> be seen before <math>w</math> and assume there is a path from <math>v</math> to <math>w</math>. We have to show that <math>w</math> is finished prior to <math>v</math>. Let <math>p'</math> denote the lexicographically smallest <math>(v,w)</math>-path. There is a stage in which this path is a subpath of the current path <math>p</math>. Clearly, <math>v</math> cannot be removed from <math>S</math> before <math>w</math>. This proves the claim.

== Complexity ==

'''Statement:''' The asymptotic complexity is in <math>\Theta(|V|+|A|)</math> in the worst case.

'''Proof:'''
For every node reachable from <math>s</math> (including <math>s</math>), the algorithm processes each of its outgoing arcs exactly one. And from each of these nodes, the algorithm goes backwards exactly once. Obviously, each of these steps requires a constant number of operations.

== Remark ==

Alternatively, DFS could be implemented as a recursive procedure. However, this excludes the option to implement DFS as an iterator, which means to turn the loop inside-out (cf. remarks on [[Graph traversal|graph traversal]]).

== Pseudocode recursive implementation ==

==== DFS(''G'') ====
:'''for''' each vertex ''u'' ∈ ''V'' [''G'']
::'''do''' color[''u''] ← WHITE
::: ''π''[''u''] ← NIL
:''time'' ← 0
:: '''do if''' ''color''[''u''] == WHITE
::: '''then''' DFS-VISiT(''u'')

====DFS-VISIT(''u'')====
: ''color''[''u''] ← GRAY
: ''time'' ← ''time'' + 1
: ''d''[''u''] ← ''time''
: '''for''' each ''v'' ∈ ''Adj''[''u'']
:: '''do if''' ''color''[''v''] = WHITE
::: ''' then ''' π [''v''] ← ''u''
:::: DFS-VISIT(''v'')
:''color''[''u''] ← BLACK
:''f''[''u''] ← ''time'' ← ''time'' + 1

== Pseudocode stack implementation ==

====DFS(''s'')====
: ''S = new Stack()''
: ''s.IsSeen = true''
: ''S.push(s)''
: '''while''' ''S'' ≠ ∅
:: ''n'' = ''S.peek()''
:: ''a'' = ''(v, w)'' = ''n.nextArc()''
:: '''if''' ''a'' == ''null''
::: ''n.IsFinised'' = ''true''
::: ''S.pop()''
:: '''else if''' ''w.IsSeen'' == ''false''
::: ''w.IsSeen'' = ''true''
::: ''S.push(w)''

Breadth-first search

2014-10-29T13:23:36Z

Flomm: