Kosaraju: Difference between revisions

<br>

Kosaraju's algorithm (also known as the Kosaraju–Sharir algorithm) is a linear time algorithm to find the strongly connected components of a directed graph. Aho, Hopcroft and Ullman credit it to an unpublished paper from 1978 by S. Rao Kosaraju. The same algorithm was independently discovered by Micha Sharir and published by him in 1981. It makes use of the fact that the transpose graph (the same graph with the direction of every edge reversed) has exactly the same strongly connected components as the original graph.

<br>

;References:

* The article on [[wp:Kosaraju's_algorithm|Wikipedia]].

 

 

 

 

 

 

 

 

 

 

{

 

}

 

{

 

=={{header|C++}}==

{{trans|D}}

#include <iostream>

#include <ostream>

 

return 0;

{{out}}

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

=={{header|D}}==

{{trans|Kotlin}} (mostly) with output like {{trans|Go}}

import std.stdio;

 

void main() {

writeln(kosaraju(g));

{{out}}

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

=={{header|Go}}==

 

import "fmt"

}

return c

{{out}}

<pre>

[0 0 0 3 3 5 5 7]

</pre>

 

=={{header|Java}}==

{{trans|Kotlin}}

Output is like Go instead of what Kotlin outputs.

import java.util.Arrays;

import java.util.List;

System.out.println(output);

}

{{out}}

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

=={{header|Julia}}==

{{trans|Go}}

 

# 1. For each vertex u of the graph, mark u as unvisited. Let L be empty.

vis = falses(length(g))

 

g = [[2], [3], [1], [2, 3, 5], [4, 6], [3, 7], [6], [5, 7, 8]]

 

{{out}}

<pre>[1, 1, 1, 4, 4, 6, 6, 8]</pre>

 

=={{header|Kotlin}}==

{{trans|Go}}

 

/* the list index is the first vertex in the edge(s) */

fun main(args: Array<String>) {

println(kosaraju(g).joinToString("\n"))

 

{{out}}

=={{header|Lua}}==

{{trans|C++}}

io.write("[")

for i=0,#a do

 

write_array(kosaraju(g))

{{out}}

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

 

=={{header|Perl}}==

use warnings;

use feature 'say';

kosaraju(%test1);

say '';

{{out}}

<pre>0 1 2

Fred Gary

Hank</pre>

 

=={{header|Phix}}==

{{out}}

<pre>

 

=={{header|Python}}==

class nonlocal: pass

 

 

g = [[1], [2], [0], [1,2,4], [3,5], [2,6], [5], [4,6,7]]

{{out}}

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

=={{header|Racket}}==

 

(require racket/dict)

(3 1 2 4) ; equvalent to (3 . (1 2 4))

(4 5 3)

 

{{out}}

 

<pre>'((7) (6 5) (4 3) (2 1 0))</pre>

 

=={{header|Sidef}}==

{{trans|Julia}}

# 1. For each vertex u of the graph, mark u as unvisited. Let L be empty.

var vis = g.len.of(false)

 

var g = [[1], [2], [0], [1, 2, 4], [3, 5], [2, 6], [5], [4, 6, 7]]

{{out}}

<pre>

 

=={{header|Standard ML}}==

 

fun node x = Node (x, ref false, ref nil, ref nil)

fun assigns (xs, nil) = xs

| assigns (xs, n :: ns) =

 

fun kosaraju xs = assigns (nil, visit (nil, Many xs :: nil))

val is = 0 :: nil

val ijs =

[0, 9, 10, 11, 12, 9, 11] ::

[1, 12] ::

 

val ns = make (16, is, ijs)

{{out}}

<pre>

> xs;

</pre>

 

{{trans|D}}

 

let size = graph.count

var x = size

]

 

 

{{out}}

 

<pre>[0, 0, 0, 3, 3, 5, 5, 7]</pre>

 

=={{header|zkl}}==

 

fcn visit(u,G,L){ // u is ((visited,assigned), (id,edges))

 

return(components);

// with vertices id zero based (vs 1 based in article)

// ids start at zero and are consecutive (no holes), graph is unsorted

T( T(0,1), T(2,0), T(5,2,6), T(6,5),

T(1,2), T(3,1,2,4), T(4,5,3), T(7,4,7,6) );

{{out}}

<pre>