Update algorithm limits and error handling

script/features/algorithms/model/plugins/EulerianLoop.js

@@ -35,6 +35,16 @@ FindEulerianLoop.prototype.getCategory = function()
     return 1;
 }
 
+FindEulerianLoop.prototype.MaxGraphSize = function()
+{
+    return 50;
+}
+
+FindEulerianLoop.prototype.MaxEgdeNumber = function()
+{
+    return 500;
+}
+
 FindEulerianLoop.prototype.result = function(resultCallback)
 {
     this.outResultCallback = function (result ) { resultCallback(result); };

script/features/algorithms/model/plugins/EulerianPath.js

@@ -35,6 +35,16 @@ FindEulerianPath.prototype.getCategory = function()
     return 1;
 }
 
+FindEulerianPath.prototype.MaxGraphSize = function()
+{
+    return 50;
+}
+
+FindEulerianPath.prototype.MaxEgdeNumber = function()
+{
+    return 500;
+}
+
 FindEulerianPath.prototype.result = function(resultCallback)
 {
     this.outResultCallback = function (result ) { resultCallback(result); };

script/features/algorithms/model/plugins/FindAllPatches.js

@@ -46,6 +46,16 @@ FindAllPathes.prototype.getCategory = function()
     return 1;
 }
 
+FindAllPathes.prototype.MaxGraphSize = function()
+{
+    return 50;
+}
+
+FindAllPathes.prototype.MaxEgdeNumber = function()
+{
+    return 40;
+}
+
 FindAllPathes.prototype.result = function(resultCallback)
 {
     if (this.firstObject && this.secondObject)

script/features/algorithms/model/plugins/FindAllShortestPatches.js

@@ -47,6 +47,16 @@ FindAllShortestPathes.prototype.getCategory = function()
     return 1;
 }
 
+FindAllShortestPathes.prototype.MaxGraphSize = function()
+{
+    return 50;
+}
+
+FindAllShortestPathes.prototype.MaxEgdeNumber = function()
+{
+    return 40;
+}
+
 FindAllShortestPathes.prototype.result = function(resultCallback)
 {
     if (this.firstObject && this.secondObject)

script/features/algorithms/model/plugins/FindLongestPath.js

@@ -47,6 +47,16 @@ FindLongestPath.prototype.getCategory = function()
     return 1;
 }
 
+FindLongestPath.prototype.MaxGraphSize = function()
+{
+    return 50;
+}
+
+FindLongestPath.prototype.MaxEgdeNumber = function()
+{
+    return 40;
+}
+
 FindLongestPath.prototype.result = function(resultCallback)
 {
     if (this.firstObject && this.secondObject)

script/features/algorithms/model/plugins/HamiltonianLoop.js

@@ -35,6 +35,16 @@ FindHamiltonianLoop.prototype.getCategory = function()
     return 1;
 }
 
+FindHamiltonianLoop.prototype.MaxGraphSize = function()
+{
+    return 30;
+}
+
+FindHamiltonianLoop.prototype.MaxEgdeNumber = function()
+{
+    return 450;
+}
+
 FindHamiltonianLoop.prototype.result = function(resultCallback)
 {
     this.outResultCallback = function (result ) { resultCallback(result); };

script/features/algorithms/model/plugins/HamiltonianPath.js

@@ -35,6 +35,16 @@ FindHamiltonianPath.prototype.getCategory = function()
     return 1;
 }
 
+FindHamiltonianPath.prototype.MaxGraphSize = function()
+{
+    return 30;
+}
+
+FindHamiltonianPath.prototype.MaxEgdeNumber = function()
+{
+    return 450;
+}
+
 FindHamiltonianPath.prototype.result = function(resultCallback)
 {
     this.outResultCallback = function (result ) { resultCallback(result); };

script/features/algorithms/model/plugins/MaxIndependentSet.js

@@ -86,6 +86,16 @@ MaxIndependentSet.prototype.getPriority = function()
     return -5;
 }
 
+MaxIndependentSet.prototype.MaxGraphSize = function()
+{
+    return 100;
+}
+
+MaxIndependentSet.prototype.MaxEgdeNumber = function()
+{
+    return 4000;
+}
+
 MaxIndependentSet.prototype.IsSupportNegativeWeight = function()
 {
     return true;