diff options
| author | ziejd2 | 2018-03-14 23:23:33 -0500 |
|---|---|---|
| committer | GitHub | 2018-03-14 23:23:33 -0500 |
| commit | 1ff6baa44e22b91eefb48aea6f3befa078c0489b (patch) | |
| tree | e0fd79d2e32fd2aedda2eadaed0f19af3514c520 /sourcecodes/bnt-master/graph/reachability_graph.m | |
| parent | 6882395afdadf4e982b25b5215071a0932730950 (diff) | |
| parent | c80226899f5cdd9f11c163817d59445213f5bef0 (diff) | |
| download | BNW-1ff6baa44e22b91eefb48aea6f3befa078c0489b.tar.gz | |
Merge pull request #1 from ziejd2/octave_php_separate
Octave php separate
Diffstat (limited to 'sourcecodes/bnt-master/graph/reachability_graph.m')
| -rw-r--r-- | sourcecodes/bnt-master/graph/reachability_graph.m | 19 |
1 files changed, 19 insertions, 0 deletions
diff --git a/sourcecodes/bnt-master/graph/reachability_graph.m b/sourcecodes/bnt-master/graph/reachability_graph.m new file mode 100644 index 00000000..0f3c4f58 --- /dev/null +++ b/sourcecodes/bnt-master/graph/reachability_graph.m @@ -0,0 +1,19 @@ +function C = reachability_graph(G) +% REACHABILITY_GRAPH C(i,j) = 1 iff there is a path from i to j in DAG G +% C = reachability_graph(G) + +if 1 + % expm(G) = I + G + G^2 / 2! + G^3 / 3! + ... + M = expm(double(full(G))) - eye(length(G)); + C = (M>0); +else + % This computes C = G + G^2 + ... + G^{n-1} + n = length(G); + A = G; + C = zeros(n); + for i=1:n-1 + C = C + A; + A = A * G; + end + C = (C > 0); +end |
