Added use of locale in Radius and Diameter algorithm

This commit is contained in:
serd2011 2021-09-19 18:27:12 +03:00
parent b2919829e3
commit c145c53ec8
12 changed files with 116 additions and 9 deletions

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -205,6 +205,7 @@
$g_lang["min_spanning_tree_ignore_direction"] = "Κατά τον υπολογισμό αγνοήσαμε την κατεύθυνση των ακμών."; $g_lang["min_spanning_tree_ignore_direction"] = "Κατά τον υπολογισμό αγνοήσαμε την κατεύθυνση των ακμών.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Ο γράφος είναι μη συνδεδεμένος"; $g_lang["min_spanning_tree_graph_not_connected"] = "Ο γράφος είναι μη συνδεδεμένος";
// IsomorphismCheck.js
$g_lang['select_first_graph_isomorphism_check'] = "Επιλέξτε τον πρώτο γράφο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποιονδήποτε κόμβο"; $g_lang['select_first_graph_isomorphism_check'] = "Επιλέξτε τον πρώτο γράφο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποιονδήποτε κόμβο";
$g_lang['select_second_graph_isomorphism_check'] = "Επιλέξτε τον δεύτερο κόμβο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποινδήποτε κόμβο"; $g_lang['select_second_graph_isomorphism_check'] = "Επιλέξτε τον δεύτερο κόμβο για έλεγχο ισομορφισμού. Κάντε κλικ σε οποινδήποτε κόμβο";
$g_lang['select_first_graph_pattern_check'] = "Επιλέξτε ένα πρότυπο γράφου κάνοντας κλικ σε οποιονδήποτε κόμβο."; $g_lang['select_first_graph_pattern_check'] = "Επιλέξτε ένα πρότυπο γράφου κάνοντας κλικ σε οποιονδήποτε κόμβο.";
@ -218,6 +219,14 @@
$g_lang['graph_has_no_atleast_2_graphs'] = "Για να χρησιμοποιήσετε τον αλγόριθμο, πρέπει να δημιουργήσετε 2 ξεχωριστούς γράφους"; $g_lang['graph_has_no_atleast_2_graphs'] = "Για να χρησιμοποιήσετε τον αλγόριθμο, πρέπει να δημιουργήσετε 2 ξεχωριστούς γράφους";
$g_lang['isomorphism_check'] = "Έλεγχος ισομορφισμού γράφων"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -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_ignore_direction"] = "Durante os cálculos ignoramos as direções dos vértices.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Grafo desconectado"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -205,6 +205,7 @@
$g_lang["min_spanning_tree_ignore_direction"] = "Мы игнорировали ориентацию дуг при рассчете."; $g_lang["min_spanning_tree_ignore_direction"] = "Мы игнорировали ориентацию дуг при рассчете.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Граф не является связным"; $g_lang["min_spanning_tree_graph_not_connected"] = "Граф не является связным";
// IsomorphismCheck.js
$g_lang['select_first_graph_isomorphism_check'] = "Выделите первый граф для проверки на изоморфизм. Кликните по любой вершине графа"; $g_lang['select_first_graph_isomorphism_check'] = "Выделите первый граф для проверки на изоморфизм. Кликните по любой вершине графа";
$g_lang['select_second_graph_isomorphism_check'] = "Выделите второй граф для проверки на изоморфизм. Кликните по любой вершине графа"; $g_lang['select_second_graph_isomorphism_check'] = "Выделите второй граф для проверки на изоморфизм. Кликните по любой вершине графа";
$g_lang['select_first_graph_pattern_check'] = "Выделите граф, которому должны быть изоморфны подграфов. Кликните по любой вершине графа"; $g_lang['select_first_graph_pattern_check'] = "Выделите граф, которому должны быть изоморфны подграфов. Кликните по любой вершине графа";
@ -218,6 +219,14 @@
$g_lang['graph_has_no_atleast_2_graphs'] = "Для использования алгоритма необходимо создать хотя бы 2 не связных графа"; $g_lang['graph_has_no_atleast_2_graphs'] = "Для использования алгоритма необходимо создать хотя бы 2 не связных графа";
$g_lang['isomorphism_check'] = "Проверка изоморфности графов"; $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['action'] = "Действия";
$g_lang['common_edge_style'] = "Стиль обычной дуги"; $g_lang['common_edge_style'] = "Стиль обычной дуги";
$g_lang['selected_edge_style'] = "Стиль выделенной дуги"; $g_lang['selected_edge_style'] = "Стиль выделенной дуги";

View File

@ -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_ignore_direction"] = "In time of calculation we have ignored the edges direction.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Graph is disconnected"; $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_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_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"; $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['graph_has_no_atleast_2_graphs'] = "To use the algorithm, you need to create 2 separate graphs";
$g_lang['isomorphism_check'] = "Check Graphs Isomorphism"; $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['action'] = "Actions";
$g_lang['common_edge_style'] = "Common edge style"; $g_lang['common_edge_style'] = "Common edge style";
$g_lang['selected_edge_style'] = "Selected edge style"; $g_lang['selected_edge_style'] = "Selected edge style";

View File

@ -22,7 +22,7 @@ RadiusAndDiameter.prototype = Object.create(BaseAlgorithm.prototype);
RadiusAndDiameter.prototype.getName = function(local) RadiusAndDiameter.prototype.getName = function(local)
{ {
return g_RadiusAndDiameter; //local == "ru" ? "Поиск радиуса и диаметра графа": "Search graph radius and diameter"; return g_RadiusAndDiameter;
} }
RadiusAndDiameter.prototype.getId = function() RadiusAndDiameter.prototype.getId = function()
@ -35,15 +35,15 @@ RadiusAndDiameter.prototype.getMessage = function(local)
{ {
if (this.isNotConnected) if (this.isNotConnected)
{ {
return (local == "ru" ? "Граф не является связным" : "Graph is disconnected"); return g_graphIsDisconnected;
} }
if (this.isOneVertex) if (this.isOneVertex)
{ {
return (local == "ru" ? "Граф содержит только одну вершину" : "Graph contains only one vertex"); return g_graphIsTrivial;
} }
var text = (local == "ru" ? "Радиус графа: " : "Graph radius: ") + this.radius; var text = g_graphRadius + ": " + this.radius;
text = text + " ("; text = text + " (";
for (i = 0; i < this.radiusSelectedObjects.length; i++) for (i = 0; i < this.radiusSelectedObjects.length; i++)
@ -55,7 +55,7 @@ RadiusAndDiameter.prototype.getMessage = function(local)
} }
text = text + ")."; text = text + ").";
text = text + (local == "ru" ? " Диаметр графа: " : "Graph diameter: ") + this.diameter; text = text + " " + g_graphDiameter + ": " + this.diameter;
text = text + " ("; text = text + " (";
for (i = 0; i < this.diameterSelectedObjects.length; i++) for (i = 0; i < this.diameterSelectedObjects.length; i++)
@ -149,12 +149,12 @@ RadiusAndDiameter.prototype.result = function(resultCallback)
if (eccentricity[i].value == this.radius) if (eccentricity[i].value == this.radius)
{ {
this.centerVertexes.push(this.graph.vertices[i].id); this.centerVertexes.push(this.graph.vertices[i].id);
this.graph.vertices[i].upText = (g_language == "ru" ? "Центральная" : "Central"); this.graph.vertices[i].upText = g_vertexCentral;
} }
if (eccentricity[i].value == this.diameter) if (eccentricity[i].value == this.diameter)
{ {
this.peripheralVertexes.push(this.graph.vertices[i].id); this.peripheralVertexes.push(this.graph.vertices[i].id);
this.graph.vertices[i].upText = (g_language == "ru" ? "Периферийная" : "Peripheral"); this.graph.vertices[i].upText = g_vertexPeripheral;
} }
} }

View File

@ -138,6 +138,7 @@ var g_selectSecondGraphIsomorphismCheck = "Select second graph for isomorphic ch
var g_selectFirstGraphPatternCheck = "Select a template graph by clicking to any node of graph"; var g_selectFirstGraphPatternCheck = "Select a template graph by clicking to any node of graph";
var g_selectSecondGraphForSearchSubgraph = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph"; var g_selectSecondGraphForSearchSubgraph = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
// IsomorphismCheck.js
var g_graphsIsomorph = "Graphs are isomorphic"; var g_graphsIsomorph = "Graphs are isomorphic";
var g_graphsNotIsomorph = "Graphs are not isomorphic"; var g_graphsNotIsomorph = "Graphs are not isomorphic";
var g_numberOfIsomorphSubgraphIs = "Number of isomorphic subgraphs are "; var g_numberOfIsomorphSubgraphIs = "Number of isomorphic subgraphs are ";
@ -147,6 +148,14 @@ var g_subgraphNo = "Isomorphic subgraph # ";
var g_graphHasNoAtleast2Graphs = "To use the algorithm, you need to create 2 separate graphs"; var g_graphHasNoAtleast2Graphs = "To use the algorithm, you need to create 2 separate graphs";
var g_IsomorphismCheck = "Check Graphs Isomorphism"; var g_IsomorphismCheck = "Check Graphs Isomorphism";
// RadiusAndDiameter.js
var g_graphIsDisconnected = "Graph is disconnected";
var g_graphIsTrivial = "Graph contains only one vertex";
var g_graphRadius = "Graph radius";
var g_graphDiameter = "Graph diameter";
var g_vertexCentral = "Central";
var g_vertexPeripheral = "Peripheral";
var g_action = "Action"; var g_action = "Action";
var g_commonEdgeStyle = "Common Edge Style"; var g_commonEdgeStyle = "Common Edge Style";
var g_selectedEdgeStyle = "Selected Edge Style"; var g_selectedEdgeStyle = "Selected Edge Style";
@ -298,7 +307,8 @@ function loadTexts()
g_selectFirstGraphPatternCheck = document.getElementById("SelectFirstGraphPatternCheck").innerHTML; g_selectFirstGraphPatternCheck = document.getElementById("SelectFirstGraphPatternCheck").innerHTML;
g_selectSecondGraphForSearchSubgraph = document.getElementById("SelectSecondGraphForSearchSubgraph").innerHTML; g_selectSecondGraphForSearchSubgraph = document.getElementById("SelectSecondGraphForSearchSubgraph").innerHTML;
// IsomorphismCheck.js
g_graphsIsomorph = document.getElementById("GraphsIsomorph").innerHTML; g_graphsIsomorph = document.getElementById("GraphsIsomorph").innerHTML;
g_graphsNotIsomorph = document.getElementById("GraphsNotIsomorph").innerHTML; g_graphsNotIsomorph = document.getElementById("GraphsNotIsomorph").innerHTML;
g_numberOfIsomorphSubgraphIs = document.getElementById("NumberOfIsomorphSubgraphIs").innerHTML; g_numberOfIsomorphSubgraphIs = document.getElementById("NumberOfIsomorphSubgraphIs").innerHTML;
@ -308,6 +318,14 @@ function loadTexts()
g_graphHasNoAtleast2Graphs = document.getElementById("GraphHasNoAtleast2Graphs").innerHTML; g_graphHasNoAtleast2Graphs = document.getElementById("GraphHasNoAtleast2Graphs").innerHTML;
g_IsomorphismCheck = document.getElementById("IsomorphismCheck").innerHTML; g_IsomorphismCheck = document.getElementById("IsomorphismCheck").innerHTML;
// RadiusAndDiameter.js
g_graphIsDisconnected = document.getElementById("GraphIsDisconnected").innerHTML;
g_graphIsTrivial = document.getElementById("GraphIsTrivial").innerHTML;
g_graphRadius = document.getElementById("GraphRadius").innerHTML;
g_graphDiameter = document.getElementById("GraphDiameter").innerHTML;
g_vertexCentral = document.getElementById("VertexCentral").innerHTML;
g_vertexPeripheral = document.getElementById("VertexPeripheral").innerHTML;
g_action = document.getElementById("ActionText").innerHTML; g_action = document.getElementById("ActionText").innerHTML;
g_commonEdgeStyle = document.getElementById("CommonEdgeStyleText").innerHTML; g_commonEdgeStyle = document.getElementById("CommonEdgeStyleText").innerHTML;
g_selectedEdgeStyle = document.getElementById("SelectedEdgeStyleText").innerHTML; g_selectedEdgeStyle = document.getElementById("SelectedEdgeStyleText").innerHTML;

View File

@ -736,7 +736,7 @@
<p id="MinSpanningIgnoreDir" class="translation"><?= L('min_spanning_tree_ignore_direction')?></p> <p id="MinSpanningIgnoreDir" class="translation"><?= L('min_spanning_tree_ignore_direction')?></p>
<p id="MinSpanningNotConnected" class="translation"><?= L('min_spanning_tree_graph_not_connected')?></p> <p id="MinSpanningNotConnected" class="translation"><?= L('min_spanning_tree_graph_not_connected')?></p>
<!-- IsomorphismCheck.js -->
<p id="SelectFirstGraphIsomorphismCheck" class="translation"><?= L('select_first_graph_isomorphism_check')?></p> <p id="SelectFirstGraphIsomorphismCheck" class="translation"><?= L('select_first_graph_isomorphism_check')?></p>
<p id="SelectSecondGraphIsomorphismCheck" class="translation"><?= L('select_second_graph_isomorphism_check')?></p> <p id="SelectSecondGraphIsomorphismCheck" class="translation"><?= L('select_second_graph_isomorphism_check')?></p>
<p id="SelectFirstGraphPatternCheck" class="translation"><?= L('select_first_graph_pattern_check')?></p> <p id="SelectFirstGraphPatternCheck" class="translation"><?= L('select_first_graph_pattern_check')?></p>
@ -750,6 +750,14 @@
<p id="GraphHasNoAtleast2Graphs" class="translation"><?= L('graph_has_no_atleast_2_graphs')?></p> <p id="GraphHasNoAtleast2Graphs" class="translation"><?= L('graph_has_no_atleast_2_graphs')?></p>
<p id="IsomorphismCheck" class="translation"><?= L('isomorphism_check')?></p> <p id="IsomorphismCheck" class="translation"><?= L('isomorphism_check')?></p>
<!-- RadiusAndDiameter.js -->
<p id="GraphIsDisconnected" class="translation"><?= L('graph_is_disconnected')?></p>
<p id="GraphIsTrivial" class="translation"><?= L('graph_is_trivial')?></p>
<p id="GraphRadius" class="translation"><?= L('graph_radius')?></p>
<p id="GraphDiameter" class="translation"><?= L('graph_diameter')?></p>
<p id="VertexCentral" class="translation"><?= L('vertex_central')?></p>
<p id="VertexPeripheral" class="translation"><?= L('vertex_peripheral')?></p>
<p id="ActionText" class="translation"><?= L('action')?></p> <p id="ActionText" class="translation"><?= L('action')?></p>
<p id="CommonEdgeStyleText" class="translation"><?= L('common_edge_style')?></p> <p id="CommonEdgeStyleText" class="translation"><?= L('common_edge_style')?></p>
<p id="SelectedEdgeStyleText" class="translation"><?= L('selected_edge_style')?></p> <p id="SelectedEdgeStyleText" class="translation"><?= L('selected_edge_style')?></p>