wolffd@0: % ---
wolffd@0: % class ClipComparedGraph
wolffd@0: % Directed graph representing comparative clip similarities.
wolffd@0: %
wolffd@0: % each node represents a clip
wolffd@0: % an edge a -> b is present if clipas a and b cooccur 
wolffd@0: % in a comparison triplet
wolffd@0: % 
wolffd@0: % ---
wolffd@0: 
wolffd@0: classdef ClipComparedGraph < Graph
wolffd@0: 
wolffd@0: % ---
wolffd@0: %  the methods
wolffd@0: % ---
wolffd@0: methods
wolffd@0: 
wolffd@0:     
wolffd@0: % constructor of the graph
wolffd@0: function G = ClipComparedGraph(comparison, comparison_ids)
wolffd@0:     
wolffd@0:     if nargin == 2
wolffd@0:     % ---
wolffd@0:     % handle automatic or manual input
wolffd@0:     % ---
wolffd@0:     for i = 1:size(comparison,1)
wolffd@0: 
wolffd@0:         % get clips and votes
wolffd@0:         clips = comparison_ids(comparison(i,1:3));
wolffd@0:     
wolffd@0:         % edges
wolffd@0:         G.add_edge(clips(1), clips(2), 1);
wolffd@0:         G.add_edge(clips(1), clips(3), 1);
wolffd@0:         G.add_edge(clips(2), clips(3), 1);
wolffd@0: %         
wolffd@0: %         % symmectric edges
wolffd@0: %         G.add_edge(clips(2), clips(1), 1);
wolffd@0: %         G.add_edge(clips(3), clips(1), 1);
wolffd@0: %         G.add_edge(clips(3), clips(2), 1);
wolffd@0:     end
wolffd@0:     
wolffd@0:     elseif nargin == 1
wolffd@0:         
wolffd@0:         % ---
wolffd@0:         % Add the input graph to the empty one
wolffd@0:         % ---
wolffd@0:         G.add_graph(comparison);
wolffd@0:         
wolffd@0:     end
wolffd@0:     
wolffd@0: % end constructor function
wolffd@0: end
wolffd@0: 
wolffd@0: end
wolffd@0: end
wolffd@0: 
wolffd@0: