From 0149bcc1f7a8a8864664c45f5cf95348c6e0146b Mon Sep 17 00:00:00 2001
From: Unick Soft <admin@unick-soft.ru>
Date: Sun, 10 Jun 2018 15:16:26 +0200
Subject: [PATCH] Added new vote

---
 script/plugins/NeedAlgorithm.js | 33 +++++++++++++++++++++++++++++++++
 tmp/vote/voteTopics.txt_en      | 10 ++++++----
 tmp/vote/voteTopics.txt_ru      | 10 ++++++----
 tpl/home.php                    |  2 +-
 4 files changed, 46 insertions(+), 9 deletions(-)

diff --git a/script/plugins/NeedAlgorithm.js b/script/plugins/NeedAlgorithm.js
index 7271454..8279b58 100644
--- a/script/plugins/NeedAlgorithm.js
+++ b/script/plugins/NeedAlgorithm.js
@@ -31,6 +31,7 @@ NeedAlgorithm.prototype.getMessage = function(local)
 
 NeedAlgorithm.prototype.result = function(resultCallback)
 {
+    /*
     var dialogButtons = {};
 
     dialogButtons[g_send] = function() {
@@ -56,7 +57,39 @@ NeedAlgorithm.prototype.result = function(resultCallback)
         dialogClass: 'EdgeDialog',
         buttons: dialogButtons,
     });
+    */
+    
+    var dialogButtons = {};
 
+    for (var i = 0; i < 6 && document.getElementById('vote' + i) !== null; i++)
+    {
+        document.getElementById('vote' + i)["voteIndex"] = i;
+        document.getElementById('vote' + i).onclick = function ()
+        {
+            console.log("Vote" + this["voteIndex"]);
+            $.ajax({
+            type: "GET",
+            url: "/cgi-bin/vote.php?index=" + this["voteIndex"],
+            dataType: "text"
+            });
+            $("#voteDialog").dialog('close');
+            $("#VoteButton").hide();
+        }
+    }
+
+    dialogButtons[g_close] = function() {
+            $( this ).dialog( "close" );					
+        }; 
+
+    $( "#voteDialog" ).dialog({
+        resizable: false,
+        title: g_vote,
+        width: 400,
+        modal: true,
+        dialogClass: 'EdgeDialog',
+        buttons: dialogButtons,
+    });
+    
     var result = {};
     result["version"] = 1;
 
diff --git a/tmp/vote/voteTopics.txt_en b/tmp/vote/voteTopics.txt_en
index 88689f2..84d2fab 100644
--- a/tmp/vote/voteTopics.txt_en
+++ b/tmp/vote/voteTopics.txt_en
@@ -1,4 +1,6 @@
-User account|Possibility to store graphs in your user account and other settings.
-Improved visualization|The ability to change colors for vertexes and edges, as well as the shape and size of the vertexes.
-Improving the support of large graphs|Make easy work with large graphs with the number of vertixes is more than 300.
-More algorithms|Add more algorithms: maximum flow, minimum cut, radius, diameter, coloring graph.
\ No newline at end of file
+Search Hamiltonian path and cycle|
+Depth-first search and breadth-first search|
+Search all paths from vertex A to vertex B|
+Search strongly connected component|
+Search longest path on graph|
+Bellman–Ford algorithm|
\ No newline at end of file
diff --git a/tmp/vote/voteTopics.txt_ru b/tmp/vote/voteTopics.txt_ru
index 2e59914..f60145a 100644
--- a/tmp/vote/voteTopics.txt_ru
+++ b/tmp/vote/voteTopics.txt_ru
@@ -1,4 +1,6 @@
-Личный кабинет|Возможность сохранения графов в своём личном кабинете и другие персоональные настройки.
-Улучшение визуализации|Возможность изменения цветов для вешин и дуг, а также формы и размеров вершин.
-Улучшение поддержки больших графов|Удобная работа с графами больших размеров с количеством вершин больше 300.
-Больше алгоритмов|Добавление большего числа алгоритмов: максимальный поток, минимальный разрез, радиус, диаметр, раскраска графа.
\ No newline at end of file
+Поиск Гамильтонова цикла и цепи|
+Поиск в глубину и поиск в ширину|
+Поиск всех путей из вершина A до вершины B|
+Поиск компоненты сильной связности графа|
+Поиск максимального пути между двумя вершинами|
+Алгоритм Беллмана-Форда|
\ No newline at end of file
diff --git a/tpl/home.php b/tpl/home.php
index 7f7489c..9e9f221 100755
--- a/tpl/home.php
+++ b/tpl/home.php
@@ -88,8 +88,8 @@
             <span class="glyphicon glyphicon-cog fa-fw "></span><span class="hidden-phone"> <?= L('algorithms') ?> </span><span class="caret"></span>
             </button>
           <ul class="dropdown-menu dropdown-menu-right" role="menu" id="algorithmList">
-            <li>
 <!--
+          <li>
 		  <button type="button" class="btn btn-default btn-sm" style="width: 100%; text-align: left; border: none;" id="FindPath"><span class="glyphicon glyphicon-search fa-fw"></span> <?= L('short_path')?></button></li>
           <li><button type="button" class="btn btn-default btn-sm" style="width: 100%; text-align: left; border: none;" id="ConnectedComponent"><span class="glyphicon glyphicon-search fa-fw"></span> <?= L('connected_component') ?> </button></li>
 		  <li><button type="button" class="btn btn-default btn-sm" style="width: 100%; text-align: left; border: none;" id="EulerianLoop"><span class="glyphicon glyphicon-refresh fa-fw"></span> <span><?= L('find_eulerian_loop')?></span></button></li>