Shortest Common Supersequence algorithm by archie94 · Pull Request #191 · algorithm-visualizer/algorithm-visualizer · GitHub
Skip to content

Shortest Common Supersequence algorithm #191

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
TornjV merged 2 commits into from
Jun 22, 2016
Merged

Shortest Common Supersequence algorithm #191

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
c951391
Shortest common supersequence algorithm
archie94 Jun 22, 2016
9243c40
Arrange LCS alphabetically
archie94 Jun 22, 2016
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion algorithm/category.json
View file
Open in desktop
38 changes: 38 additions & 0 deletions algorithm/dp/shortest_common_supersequence/basic/code.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
var i,j;

// Fill memo table in bottom up manner
for ( i = 0; i <= m; i++ ) {
for ( j = 0; j <= n; j++ ) {
if( i === 0 ) {
A[i][j] = j;
} else if ( j === 0 ) {
A[i][j] = i;
} else if ( string1[i-1] == string2[j-1] ) {
tracer1._select ( i-1 )._wait ();
tracer2._select ( j-1 )._wait ();
tracer3._select ( i-1, j-1 )._wait ();

A[i][j] = A[i-1][j-1] + 1;

tracer1._deselect ( i-1 );
tracer2._deselect ( j-1 );
tracer3._deselect ( i-1, j-1 );
} else {
tracer3._select ( i-1, j )._wait ();
tracer3._select ( i, j-1 )._wait ();

if ( A[i-1][j] < A[i][j-1] ) {
A[i][j] = 1 + A[i-1][j];
} else {
A[i][j] = 1 + A[i][j-1];
}

tracer3._deselect ( i-1, j );
tracer3._deselect ( i, j-1 );
}
tracer3._notify ( i, j , A[i][j] )._wait ();
tracer3._denotify( i, j );
}
}

logger._print ( 'Shortest Common Supersequence is ' + A[m][n] );
13 changes: 13 additions & 0 deletions algorithm/dp/shortest_common_supersequence/basic/data.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
var string1 = 'AGGTAB';
var string2 = 'GXTXAYB';
var m = string1.length;
var n = string2.length;
var A = new Array (m+1);
for (var i = 0; i < m+1; i++ ) {
A[i] = new Array (n+1);
}

var tracer1 = new Array1DTracer ( 'String 1')._setData ( string1 );
var tracer2 = new Array1DTracer ( 'String 2')._setData ( string2 );
var tracer3 = new Array2DTracer ( 'Memo Table')._setData ( A );
var logger = new LogTracer ();
13 changes: 13 additions & 0 deletions algorithm/dp/shortest_common_supersequence/desc.json
View file
Open in desktop