mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2026-06-17 06:11:37 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add check graphs isomophism.

Browse Source 
Changed some default styles.
This commit is contained in:
Oleg Sh
2021-01-31 17:23:22 +02:00
parent 81d224c428
commit 8c3e607d2c
16 changed files with 467 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lang/de/home.php
+14
View File
@@ -166,4 +166,18 @@
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/el/home.php
+13
View File
@@ -204,4 +204,17 @@
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/en/home.php
+14
View File
@@ -203,4 +203,18 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/es/home.php
+14
View File
@@ -203,4 +203,18 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/fr/home.php
+14
View File
@@ -171,4 +171,18 @@
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/nl/home.php
+14
View File
@@ -168,4 +168,18 @@
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/pt/home.php
+13
View File
@@ -170,4 +170,17 @@
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>
lang/ru/home.php
+14
View File
@@ -204,4 +204,18 @@
$g_lang["min_spanning_tree_res_is"] = "Вес минимального остовного дерева равен ";
$g_lang["min_spanning_tree_ignore_direction"] = "Мы игнорировали ориентацию дуг при рассчете.";
$g_lang["min_spanning_tree_graph_not_connected"] = "Граф не является связным";
$g_lang['select_first_graph_isomorphism_check'] = "Выделите первый граф для проверки на изоморфизм. Кликните по любой вершине графа";
$g_lang['select_second_graph_isomorphism_check'] = "Выделите второй граф для проверки на изоморфизм. Кликните по любой вершине графа";
$g_lang['select_first_graph_pattern_check'] = "Выделите граф, которому должны быть изоморфны подграфов. Кликните по любой вершине графа";
$g_lang['select_second_graph_for_search_subgraph'] = "Выделите граф в котором необходимо найти изоморфные подграфы. Кликните по любой вершине графа";
$g_lang['graphs_isomorph'] = "Графы изоморфны";
$g_lang['graphs_not_isomorph'] = "Графы не изоморфны";
$g_lang['number_of_isomorph_subgraph_is'] = "Количество изоморфных подграфов равно ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Граф не содержит изоморфных подграфов";
$g_lang['search_isomorph_subgraph'] = "Поиск изоморфных подграфов";
$g_lang['subgraph_no'] = "Изоморфных подграф № ";
$g_lang['graph_has_no_atleast_2_graphs'] = "Для использования алгоритма необходимо создать хотя бы 2 не связных графа";
$g_lang['isomorphism_check'] = "Проверка изоморфности графов";
?>
lang/sv/home.php
+14
View File
@@ -165,4 +165,18 @@
$g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";
$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['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";
$g_lang['select_second_graph_for_search_subgraph'] = "Choose a graph in which we will look for isomorphic subgraphs. Click to any node of this graph";
$g_lang['graphs_isomorph'] = "Graphs are isomorphic";
$g_lang['graphs_not_isomorph'] = "Graphs are not isomorphic";
$g_lang['number_of_isomorph_subgraph_is'] = "Number of isomorphic subgraphs are ";
$g_lang['graph_has_no_isomorph_subgraph'] = "Graph doesn't contain isomorphic subgraphs";
$g_lang['search_isomorph_subgraph'] = "Search isomorphic subgraphs";
$g_lang['subgraph_no'] = "Isomorphic subgraph # ";
$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";
?>