mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-04-13 19:26:21 +00:00
Support multigraph for algorithms:
- Find all paths. - Find longest path. - Find all shortest paths.
This commit is contained in:
@@ -330,4 +330,5 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -332,4 +332,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -331,4 +331,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
@@ -289,4 +289,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -328,4 +328,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -333,4 +333,5 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -332,4 +332,5 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -299,4 +299,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -296,4 +296,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -332,4 +332,5 @@ Dodaliśmy polskie tłumaczenie, Patryk</a>";
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -297,4 +297,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -287,7 +287,7 @@
|
||||
$g_lang['use_context_menu'] = "Используйте контекстное меню для дополнительных действий.";
|
||||
|
||||
$g_lang['find_longest_path'] = "Поиск самого длинного пути";
|
||||
$g_lang['length_of_longest_path_from'] = "Длина самого длинного пути ровна ";
|
||||
$g_lang['length_of_longest_path_from'] = "Длина самого длинного пути равна ";
|
||||
|
||||
|
||||
$g_lang['additionl_actions'] = "Особые действия";
|
||||
@@ -337,4 +337,6 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Найти все кратчайшие пути между вершинами";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Количество кратчайших путей из ";
|
||||
$g_lang['length_is'] = "длина равна ";
|
||||
|
||||
?>
|
||||
|
||||
@@ -293,4 +293,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Find all shortest paths between 2 vertices";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Number of shortest paths from ";
|
||||
$g_lang['length_is'] = "length is ";
|
||||
?>
|
||||
|
||||
@@ -335,4 +335,5 @@
|
||||
|
||||
$g_lang['find_all_shortest_pathes'] = "Найти все кратчайшие пути между вершинами";
|
||||
$g_lang['number_of_shortest_pathes_from'] = "Количество кратчайших путей из ";
|
||||
$g_lang['length_is'] = "длина равна ";
|
||||
?>
|
||||
|
||||
Reference in New Issue
Block a user