mirror of
https://github.com/UnickSoft/graphonline.git
synced 2026-02-16 10:40:57 +00:00
Add algorithm to find all shortest paths from one vertex to another.
This commit is contained in:
@@ -230,4 +230,9 @@
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -268,4 +268,9 @@
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -267,4 +267,9 @@ We have added Dutch translation 🇳🇱. Thank you Willie de Wit</a>";
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -266,5 +266,10 @@ Tenemos traducciones en griego 🇬🇷.</a> <a href=\"https://github.com/UnickS
|
||||
$g_lang['are'] = " are ";
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -234,5 +234,10 @@
|
||||
$g_lang['are'] = " are ";
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
@@ -231,5 +231,10 @@
|
||||
$g_lang['are'] = " are ";
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -232,5 +232,10 @@
|
||||
$g_lang['are'] = " are ";
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
@@ -268,4 +268,9 @@
|
||||
$g_lang['path_n'] = "Путь №";
|
||||
$g_lang['selected_finish_vertex'] = "Выделите конечную вершину";
|
||||
$g_lang['selected_start_vertex'] = "Выделите начальную вершину";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Найти все кратчайшие пути от вершины";
|
||||
$g_lang['distance_from'] = "Расстояние от ";
|
||||
$g_lang['path_to'] = "Путь до ";
|
||||
?>
|
||||
|
||||
@@ -229,4 +229,9 @@
|
||||
$g_lang['path_n'] = "Path #";
|
||||
$g_lang['selected_finish_vertex'] = "Select finish vertex";
|
||||
$g_lang['selected_start_vertex'] = "Select start vertex";
|
||||
|
||||
// FindShortPatchsFromOne.js
|
||||
$g_lang['find_all_paths_from_vertex'] = "Find all shortest paths from vertex";
|
||||
$g_lang['distance_from'] = "Distance from ";
|
||||
$g_lang['path_to'] = "Path to ";
|
||||
?>
|
||||
|
||||
Reference in New Issue
Block a user