Fixed shrt path algorithm name for graphs with negative edges. Fix loader.

lang/nl/home.php

@@ -164,6 +164,7 @@
     $g_lang["modern_graph_style_name"] = "Visualisatie op basis van gewicht";
     $g_lang["radius_and_diameter_name"] = "Zoek grafiek straal en diameter";
     $g_lang["find_short_path_name"] = "Kortstepad-algoritme (Dijkstra's algoritme)";
+    $g_lang["find_short_path_belman_ford_name"] = "Find shortest path using Bellman–Ford's algorithm";
     $g_lang["vertices_degree_name"] = "Bereken hoekpunten graden";
 
     $g_lang["min_spanning_tree_res_is"] = "Weight of minimum spanning tree is ";