wolffd@0: 
wolffd@0: % Results:
wolffd@0: Gcomp = ClipComparedGraph(comparison, comparison_ids)
wolffd@0: [Gcompcomps] = Gcomp.connected_components();
wolffd@0: % only 2graphs  with 7 nodes, all subtriplets just connect via
wolffd@0: % one node -> no "infestation" of other triplets
wolffd@0: 
wolffd@0: G = ClipSimGraph(comparison, comparison_ids)
wolffd@0: [Gs,s, id] = G.all_strongly_connected_components();
wolffd@0: u = hist(s);
wolffd@0: % 179 cycled triplets in unprepared graph
wolffd@0: 
wolffd@0: Gmd = ClipSimGraphMD(comparison, comparison_ids)
wolffd@0: [Gsmd, smd, id] = Gmd.all_strongly_connected_components();
wolffd@0: Gsmd(1).order;
wolffd@0: % Not a single triple cycle found
wolffd@0: 
wolffd@0: % ---
wolffd@0: % analysis on compliance with stobers preprocessing
wolffd@0: % trying to find out the differing ? Graph structures
wolffd@0: % for that sake analysis with connected (no cycles) components
wolffd@0: % ---
wolffd@0: Graw = ClipSimGraph(comparison, comparison_ids);
wolffd@0: [Gsraw, sraw] = connected_components(Graw)
wolffd@0: hist(sraw)
wolffd@0: % in the unedited graph, there are 346 connected triplets
wolffd@0: 
wolffd@0: Gm = ClipSimGraphMulti(comparison, comparison_ids);
wolffd@0: [Gsraw2, sraw2] = connected_components(Gm)
wolffd@0: u = hist(sraw2)
wolffd@0: % in this unedited graph, there are still 346 connected triplets
wolffd@0: 
wolffd@0: Gm.remove_cycles_length2;
wolffd@0: [Gs, s, id] = connected_components(DiGraph(Gm));
wolffd@0: u = hist(s)
wolffd@0: % 27 single nodes, 337 three-node graphs. why not two-nodes
wolffd@0: 
wolffd@0: % which clips do these belong to?
wolffd@0: soloid = find(s == 1);
wolffd@0: soloclips = [];
wolffd@0: for i = 1:numel(soloid)
wolffd@0:     tmpG = ClipSimGraph(Gs(soloid(i)));
wolffd@0:     
wolffd@0:     % get the clisp of the single node
wolffd@0:     [sm, bg] = tmpG.clipsN(tmpG.nodes);
wolffd@0:     soloclips = [soloclips sm bg];
wolffd@0: end
wolffd@0: soloclips = unique(soloclips)
wolffd@0: % exactly 27 clips lost
wolffd@0:     
wolffd@0: % now with our graph processing
wolffd@0: Gmd = ClipSimGraphMD(comparison, comparison_ids)
wolffd@0: [Gsmd, smd] = connected_components(Gmd)
wolffd@0: % same result,
wolffd@0: 
wolffd@0: % ---
wolffd@0: % now which are the orphaned nodes ?
wolffd@0: % ---
wolffd@0: Go = Gm.unconnected_subgraph();
wolffd@0: Go.label(Go.nodes)
wolffd@0: 
wolffd@0: % ---
wolffd@0: % how many clips are completely lost?
wolffd@0: % ---
wolffd@0: Go = ClipSimGraphMulti(Gm.unconnected_subgraph());
wolffd@0: Go.clips
wolffd@0: numel(ans)
wolffd@0: Gm.remove_graph(Go) % 
wolffd@0: lastClip = intersect(Go.clips,Gm.clips)
wolffd@0: 
wolffd@0: % ---
wolffd@0: % ok lets chase the last clip
wolffd@0: % ---
wolffd@0: Gm.node(21950)
wolffd@0: Gs = Gm.connected_components(283);
wolffd@0: Gs.visualise
wolffd@0: DiGraph(Go).visualise
wolffd@0: 
wolffd@0: 
wolffd@0: % ---
wolffd@0: % validation with comparison data
wolffd@0: % ---
wolffd@0: Gm = ClipSimGraphMulti(comparison, comparison_ids);
wolffd@0: num_compares = sparse(numel(comparison_ids), numel(comparison_ids));
wolffd@0: for i = 1:size(comparison,1)
wolffd@0: abc = sort(comparison(i,1:3));
wolffd@0: a = abc(1);
wolffd@0: b = abc(2);
wolffd@0: c = abc(3);
wolffd@0: num_compares(a,b) = num_compares(a,b) +1;
wolffd@0: num_compares(b,c) = num_compares(b,c) +1;
wolffd@0: num_compares(a,c) = num_compares(a,c) +1;
wolffd@0: end
wolffd@0: 
wolffd@0: [i,j] = ind2sub(find(num_compares > 2))
wolffd@0: [i,j] = ind2sub(size(num_compares), find(num_compares > 2))
wolffd@0: [i,j] = ind2sub(size(num_compares), find(num_compares > 1)),
wolffd@0: i(1)
wolffd@0: j(1)
wolffd@0: find(comparison(:,1) == i(1) || comparison(:,2) == i(1) || comparison(:,3) == i(1)...)
wolffd@0: && comparison(:,1) == j(1) || comparison(:,2) == j(1) || comparison(:,3) == j(1))
wolffd@0: find((comparison(:,1) == i(1) | comparison(:,2) == i(1) | comparison(:,3) == i(1))...)
wolffd@0: & (comparison(:,1) == j(1) | comparison(:,2) == j(1) | comparison(:,3) == j(1)))
wolffd@0: 
wolffd@0: num = 2;
wolffd@0: a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0: & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0: comparison(a,:)
wolffd@0: [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0: num = 3;
wolffd@0: a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0: & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0: comparison(a,:)
wolffd@0: [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0: num = 18;
wolffd@0: a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0: & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0: comparison(a,:)
wolffd@0: [i,j] = ind2sub(size(num_compares), find(num_compares > 1))
wolffd@0: num = 300;
wolffd@0: a = find((comparison(:,1) == i(num) | comparison(:,2) == i(num) | comparison(:,3) == i(num))...)
wolffd@0: & (comparison(:,1) == j(num) | comparison(:,2) == j(num) | comparison(:,3) == j(num)))
wolffd@0: comparison(a,:)
wolffd@0: 
wolffd@0: % ---
wolffd@0: % other simulated data
wolffd@0: % ---
wolffd@0: ClipSimGraph([1 2 3 5 1 0;], 1:100).visualise
wolffd@0: ClipSimGraph([1 2 3 5 1 0; 1 2 4 6 0 0], 1:100).visualise
wolffd@0: ClipSimGraph([1 2 3 5 1 0; 1 2 4 6 0 0], 1:100).max_degree
wolffd@0: G = ClipSimGraph(comparison, comparison_ids);
wolffd@0: 
wolffd@0: % --- 
wolffd@0: % scc algorithm tests
wolffd@0: % ---
wolffd@0: V = ones(1,5)
wolffd@0: E = zeros(5)
wolffd@0: for i=1:4
wolffd@0: E(i+1,i) = 1
wolffd@0: end
wolffd@0: E(1,4) = 1
wolffd@0: gtest = DiGRaph(V,E)
wolffd@0: 
wolffd@0: gtest.strongly_connected_components(4)
wolffd@0: gtest.strongly_connected_components(5)
wolffd@0: