mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-02-16 10:40:57 +00:00
Added use of locale in Radius and Diameter algorithm
This commit is contained in:
@@ -167,6 +167,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -180,6 +181,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -205,6 +205,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "Κατά τον υπολογισμό αγνοήσαμε την κατεύθυνση των ακμών.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Ο γράφος είναι μη συνδεδεμένος";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Επιλέξτε τον πρώτο γράφο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποιονδήποτε κόμβο";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Επιλέξτε τον δεύτερο κόμβο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποινδήποτε κόμβο";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Επιλέξτε ένα πρότυπο γράφου κάνοντας κλικ σε οποιονδήποτε κόμβο.";
|
||||
@@ -218,6 +219,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "Για να χρησιμοποιήσετε τον αλγόριθμο, πρέπει να δημιουργήσετε 2 ξεχωριστούς γράφους";
|
||||
$g_lang['isomorphism_check'] = "Έλεγχος ισομορφισμού γράφων";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -204,6 +204,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -217,6 +218,14 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -204,6 +204,7 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -217,6 +218,14 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -172,6 +172,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -185,6 +186,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -169,6 +169,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -182,6 +183,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -170,6 +170,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "Durante os cálculos ignoramos as direções dos vértices.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Grafo desconectado";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -183,6 +184,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
@@ -205,6 +205,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "Мы игнорировали ориентацию дуг при рассчете.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Граф не является связным";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Выделите первый граф для проверки на изоморфизм. Кликните по любой вершине графа";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Выделите второй граф для проверки на изоморфизм. Кликните по любой вершине графа";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Выделите граф, которому должны быть изоморфны подграфов. Кликните по любой вершине графа";
|
||||
@@ -218,6 +219,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "Для использования алгоритма необходимо создать хотя бы 2 не связных графа";
|
||||
$g_lang['isomorphism_check'] = "Проверка изоморфности графов";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Граф не является связным";
|
||||
$g_lang['graph_is_trivial'] = "Граф содержит только одну вершину";
|
||||
$g_lang['graph_radius'] = "Радиус графа";
|
||||
$g_lang['graph_diameter'] = "Диаметр графа";
|
||||
$g_lang['vertex_central'] = "Центральная";
|
||||
$g_lang['vertex_peripheral'] = "Периферийная";
|
||||
|
||||
$g_lang['action'] = "Действия";
|
||||
$g_lang['common_edge_style'] = "Стиль обычной дуги";
|
||||
$g_lang['selected_edge_style'] = "Стиль выделенной дуги";
|
||||
|
||||
@@ -166,6 +166,7 @@
|
||||
$g_lang["min_spanning_tree_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
|
||||
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected";
|
||||
|
||||
// IsomorphismCheck.js
|
||||
$g_lang['select_first_graph_isomorphism_check'] = "Select first graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_second_graph_isomorphism_check'] = "Select second graph for isomorphic check. Click to any node of graph";
|
||||
$g_lang['select_first_graph_pattern_check'] = "Select a template graph by clicking to any node of graph";
|
||||
@@ -179,6 +180,14 @@
|
||||
$g_lang['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
|
||||
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism";
|
||||
|
||||
// RadiusAndDiameter.js
|
||||
$g_lang['graph_is_disconnected'] = "Graph is disconnected";
|
||||
$g_lang['graph_is_trivial'] = "Graph contains only one vertex";
|
||||
$g_lang['graph_radius'] = "Graph radius";
|
||||
$g_lang['graph_diameter'] = "Graph diameter";
|
||||
$g_lang['vertex_central'] = "Central";
|
||||
$g_lang['vertex_peripheral'] = "Peripheral";
|
||||
|
||||
$g_lang['action'] = "Actions";
|
||||
$g_lang['common_edge_style'] = "Common edge style";
|
||||
$g_lang['selected_edge_style'] = "Selected edge style";
|
||||
|
||||
Reference in New Issue
Block a user