comparison toolboxes/FullBNT-1.0.7/graph/reachability_graph.m @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
comparison
equal deleted inserted replaced
-1:000000000000 0:cc4b1211e677
1 function C = reachability_graph(G)
2 % REACHABILITY_GRAPH C(i,j) = 1 iff there is a path from i to j in DAG G
3 % C = reachability_graph(G)
4
5 if 1
6 % expm(G) = I + G + G^2 / 2! + G^3 / 3! + ...
7 M = expm(double(full(G))) - eye(length(G));
8 C = (M>0);
9 else
10 % This computes C = G + G^2 + ... + G^{n-1}
11 n = length(G);
12 A = G;
13 C = zeros(n);
14 for i=1:n-1
15 C = C + A;
16 A = A * G;
17 end
18 C = (C > 0);
19 end