mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-06-16 22:01:00 +00:00
Add longest path algorithm.
This commit is contained in:
@@ -277,4 +277,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -277,4 +277,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -240,4 +240,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -278,4 +278,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -277,4 +277,7 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -277,4 +277,7 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -245,4 +245,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -242,4 +242,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -243,4 +243,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
@@ -278,4 +278,7 @@
|
||||
$g_lang['other_algorithms'] = "Другие алгоритмы";
|
||||
|
||||
$g_lang['use_context_menu'] = "Используйте контекстное меню для дополнительных действий.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Поиск самого длинного пути";
|
||||
$g_lang['length_of_longest_path_from'] = "Длина самого длинного пути ровна ";
|
||||
?>
|
||||
|
||||
@@ -239,4 +239,7 @@
|
||||
$g_lang['other_algorithms'] = "Other algorithms";
|
||||
|
||||
$g_lang['use_context_menu'] = "Use context menu for additional actions.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Find the longest path";
|
||||
$g_lang['length_of_longest_path_from'] = "Length of the longest path from ";
|
||||
?>
|
||||
|
||||
Reference in New Issue
Block a user