mirrors/graphonline
1
0
Fork 0
mirror of https://github.com/UnickSoft/graphonline.git synced 2025-07-02 15:56:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #34 from xingyi-zhang/master

Browse Source 
added Chinese language
This commit is contained in:
Unick Soft 2021-12-21 21:26:37 +02:00 committed by GitHub
commit 2112a2a534
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
15 changed files with 425 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
lang/ch/404.php Normal file
View File

@ -0,0 +1,7 @@
<?php
$g_lang["head"] = "找不到页面";
$g_lang["message"] = "<p>抱歉, 服务器上找不到此页面.</p>\n\n<p>也许, 这些选项&nbsp;可以帮助你:</p>\n\n<ul>\n <li>前往 <a href=\"/\" title=\"前往主页\">主页</a></li>\n <li>返回 <a href=\"javascript:history.back()\" title=\"返回前一页\">前一页</a></li>\n</ul>\n";
$g_lang["m_title"] = "404 找不到页面";
?>

6
lang/ch/_500.php Normal file
View File

@ -0,0 +1,6 @@
<?php
$g_lang['m_title'] = '500 内部服务器错误';
$g_lang['head'] = '网站错误';
$g_lang['message'] = '抱歉, 网站出现了一个错误.';
?>

9
lang/ch/about.php Normal file
View File

@ -0,0 +1,9 @@
<?php
$g_lang["title_notg"] = "关于在线画图(Graph Online)项目";
$g_lang["text"] = "<p>在线画图(Graph Online) 的&nbsp;作者是&nbsp;<a href=\"http://grafoanalizator.unick-soft.ru/en/\" style=\"color: rgb(207, 56, 34); margin: 0px;\"><span style=\"color:#000000\">Graphanalyzer的作者</span></a>. 现在是教育和商业用途的一个在线服务.</p>\n";
$g_lang["m_title"] = "关于在线画图(Graph Online)的服务";
$g_lang["m_keyWords"] = "在线画图, 寻找最短路, 图可视化";
$g_lang["m_description"] = "关于在线画图(Graph Online)项目";
?>

8
lang/ch/autoload/main.php Normal file
View File

@ -0,0 +1,8 @@
<?php
$g_lang["m_titlePostfix"] = "";
$g_lang["m_title"] = "Graph Online";
$g_lang["m_keyWords"] = "Graph Online, 找最短路, 可视化";
$g_lang["m_description"] = "";
?>

9
lang/ch/contacts.php Normal file
View File

@ -0,0 +1,9 @@
<?php
$g_lang["title_notg"] = "Graph Online 反馈";
$g_lang["text"] = "<p>请将您的问题发送至 <a href=\"mailto:admin@graphonline.ru?subject=Graphonline%20-%20feedback\">admin@graphonline.ru</a> 或查看 <a href=\"https://www.facebook.com/pg/Graphonline-2230709670325388\" target=\"_blank\">我们的 facebook 网页</a></p>";
$g_lang["m_title"] = "Graph Online 联系";
$g_lang["m_keyWords"] = "graph online 联系";
$g_lang["m_description"] = "联系Graph online的管理员.";
?>

12
lang/ch/create_algorithm.php Normal file
View File

@ -0,0 +1,12 @@
<?php
include ("home.php");
$g_lang["title_notg"] = "自己创造图的算法";
$g_lang["text"] = "<p>使用JavaScript创造图的算法. 了解更多 <a href=\"http://graphonline.ru/en/wiki/Development/Documentation\">阅读 API 文件</a>.</p>\n";
$g_lang["m_title"] = "使用JavaScript为graph online创造自己的算法";
$g_lang["m_keyWords"] = "图, 算法, JavaScript";
$g_lang["m_description"] = "使用JavaScript为graph online创造算法";
?>

19
lang/ch/create_graph_by_incidence_matrix.php Normal file
View File

@ -0,0 +1,19 @@
<?php
$g_lang["head_no_tags"] = "使用关联矩阵创造图";
$g_lang["text"] = "<p>在本页面您可以输入关联矩阵并创造图</p>\n";
$g_lang["incidence_matrix_description"] = "输入关联矩阵. 使用逗号 \",\" 作为分割符 并且按下\"画图\".";
$g_lang["incidence_matrix_bad_format"] = "矩阵不正确. 使用逗号 \",\" 作为分割符. 矩阵应该为方阵.";
$g_lang["plot_graph_button"] = "画图";
$g_lang["matrix_matrix_input"] = "输入表格";
$g_lang["text_matrix_input"] = "输入文本";
$g_lang["incidence_matrix_description_matrix"] = "输入关联矩阵. 按下 \"画图\" 来创造图.";
$g_lang["add_edge_to_matrix"] = "添加边";
$g_lang["add_node_to_matrix"] = "添加顶点";
$g_lang["m_title"] = "使用关联矩阵创造图";
$g_lang["m_keyWords"] = "graph online, 画图, 使用关联矩阵创造图, 关联矩阵";
$g_lang["m_description"] = "在线使用关联矩阵创造图并查看图像";
$g_lang["use_ctrl_to_move_cells"] = "使用 Ctrl + &#8592; &#8593; &#8594; &#8595; 键在格之间移动.";
?>

23
lang/ch/create_graph_by_matrix.php Normal file
View File

@ -0,0 +1,23 @@
<?php
$g_lang["head_no_tags"] = "使用邻接矩阵创造图";
$g_lang["text"] = "<p>在本页面您可以输入&nbsp;邻接矩阵并创造图</p>\n";
$g_lang["adjacency_matrix_description"] = "输入邻接矩阵. 使用逗号 \",\" 作为分割符 并且按下 \"画图\".";
$g_lang["adjacency_matrix_bad_format"] = "矩阵不正确. 使用逗号 \",\" 作为分割符.矩阵应该为方阵.";
$g_lang["plot_graph_button"] = "画图";
$g_lang["matrix_matrix_input"] = "输入表格";
$g_lang["text_matrix_input"] = "输入文本";
$g_lang["adjacency_matrix_description_matrix"] = "输入邻接矩阵. 按下 \"画图\".";
$g_lang["add_node_to_matrix"] = "添加顶点";
$g_lang["m_title"] = "使用邻接矩阵创造图";
$g_lang["m_keyWords"] = "graph online, 画图, 使用邻接矩阵创造图, 邻接矩阵";
$g_lang["m_description"] = "在线使用邻接矩阵创造图并查看图像";
$g_lang["current_language"] = "ch";
$g_lang["separator"] = "分割符: ";
$g_lang["separator_commo"] = "逗号";
$g_lang["separator_space"] = "空格";
$g_lang["use_ctrl_to_move_cells"] = "使用 + &#8592; &#8593; &#8594; &#8595; 键在格之间移动.";
?>

10
lang/ch/graphs_examples.php Normal file
View File

@ -0,0 +1,10 @@
<?php
$g_lang["head_no_tags"] = "图的例子";
$g_lang["text"] = "<p>在这里你可以找到一些图的例子, 你可以基于其中的一个来创造自己的图.</p>\n";
$g_lang["current_language"] = "ch";
$g_lang["m_title"] = "Graph Online: 图的例子";
$g_lang["m_keyWords"] = "图的例子, 图的集合, 创造图";
$g_lang["m_description"] = "图例集合";
?>

9
lang/ch/help.php Normal file
View File

@ -0,0 +1,9 @@
<?php
$g_lang["title_notg"] = "Graph Online 帮助";
$g_lang["text"] = "<p><iframe allowfullscreen=\"\" frameborder=\"0\" height=\"315\" src=\"//www.youtube.com/embed/Sx4tOe3bWNg\" width=\"560\"></iframe></p>\n<h3>添加 顶点</h3>\n\n<p>创造一个图你需要 <a href=\"http://graphonline.ru/en/\">来添加顶点</a>. 选择 «添加 顶点» 并点击工作页面.</p>\n\n<p><img alt=\"Add vertices\" src=\"/i/image/help/addVertexEn.gif\" /></p>\n\n<p>&nbsp;</p>\n\n<h3>连接顶点</h3>\n\n<p>连接顶点你需要 <a href=\"http://graphonline.ru/en/\">选择 «连接顶点»</a> 并选择第一个顶点然后再选择第二个顶点.</p>\n\n<p><img alt=\"Connect vertices Graph Online\" src=\"/i/image/help/addEdgeEn.gif\"/></p>\n\n<p>在框中你可以选择加权或者留空来不加权重.你也可以选择图的类型, 例如 有向或者无向. </p>\n\n<h3>找最短路</h3>\n\n<p>选择 <a href=\"http://graphonline.ru/en/\">«找最短路»</a> 在下拉菜单里. 之后选择起点和终点. 如果两点之间有路, 图像上将会显示出来. 我们使用 Dijkstra 算法.</p>\n\n<p><img alt=\"Find shortest path on graph\" src=\"/i/image/help/findShortPathesEn.gif\" /></p>\n\n<p>&nbsp;</p>\n";
$g_lang["m_title"] = "Graph Online 帮助";
$g_lang["m_keyWords"] = "图, 帮助";
$g_lang["m_description"] = "Graph online 帮助页面";
?>

275
lang/ch/home.php Normal file
View File

@ -0,0 +1,275 @@
<?php
$g_lang["title_notg"] = "找最短路";
$g_lang["text"] = "<p>创造图并寻找最短路. 在帮助页面<a href=\"/en/help\">您可以找到视频教程</a>.</p>\n";
$g_lang["add_node"] = "添加顶点";
$g_lang["connect_nodes"] = "链接顶点";
$g_lang["delete"] = "删除对象";
$g_lang["default"] = "拉";
$g_lang["short_path"] = "找最短路";
$g_lang["save_direction_choose"] = "保存边的类型";
$g_lang["edge_weight"] = "边的权重";
$g_lang["save_weight_choose"] = "在之后的变使用一样的数值";
$g_lang["default_weight"] = "无权重";
$g_lang["browser_no_support"] = "您的浏览器不支持";
$g_lang["select_and_move_objects"] = "使用鼠标选择和移动对象.";
$g_lang["move_cursor_for_moving"] = "拖曳鼠标来移动物体";
$g_lang["add_graph"] = "添加边";
$g_lang["orint_edge"] = "有向";
$g_lang["not_orint_edge"] = "无向";
$g_lang["show_adjacency_matrix"] = "邻接矩阵";
$g_lang["save"] = "保存";
$g_lang["cancel"] = "取消";
$g_lang["adjacency_matrix_description"] = "创建邻接矩阵. 使用逗号 \",\" 作为分隔符";
$g_lang["adjacency_matrix_bad_format"] = "矩阵不正确. 使用逗号 \",\" 作为分割符. 矩阵应该为方阵";
$g_lang["delete_all"] = "删除所有";
$g_lang["click_to_add_vertex"] = "并点击工作页面添加顶点. <span style=\"float:right;\">顶点标序 " .
"<select id=\"enumVertexsText\">" .
"</select></span>";
$g_lang["select_first_vertext_to_connect"] = "选择边的第一个顶点";
$g_lang["select_second_vertext_to_connect"] = "选择边的第二个顶点";
$g_lang["select_start_short_path_vertex"] = "选择最短路的起点";
$g_lang["select_finish_short_path_vertex"] = "选择最短路的终点";
$g_lang["short_path_result"] = "最短路的长度是 %d";
$g_lang["path_not_exists"] = "路不存在";
$g_lang["select_object_to_delete"] = "点击对象来删除";
$g_lang["shortest_dist"] = "最短距离是 ";
$g_lang["show_incidence_matrix"] = "关联矩阵";
$g_lang["incidence_matrix_description"] = "创建关联矩阵. 使用逗号 \",\" 作为分隔符.";
$g_lang["incidence_matrix_bad_format"] = "矩阵不正确. 使用逗号 \",\" 作为分割符.";
$g_lang["this_is_graph_link"] = "图已保存. 使用链接查看.";
$g_lang["share_graph_text"] = "Graph Online: 保存的图";
$g_lang["share_graph_description"] = "在社交媒体上分享这个链接:";
$g_lang["graph"] = "图";
$g_lang["save_dialog_title"] = "保存图";
$g_lang["close_button"] = "关闭";
$g_lang["connected_component"] = "找连通块";
$g_lang["sick_connected_component_result"] = "弱连通块的数量是 ";
$g_lang["connected_component_result"] = "连通块的数量是 ";
$g_lang["new_graph"] = "创造图h";
$g_lang["what_do_you_think"] = "您对本网站的建议?";
$g_lang["name"] = "名字 (邮件 如果需要回复)";
$g_lang["feedback"] = "反馈";
$g_lang["send"] = "发送";
$g_lang["write_to_us"] = "联系或者反馈, 可以写邮件至 ";
$g_lang["fix_matrix_button"] = "修正矩阵";
$g_lang["open_matrix_help"] = "帮助";
$g_lang["wrong_matrix_title"] = "矩阵格式不正确";
$g_lang["bad_adj_matrix_message"] = "无法创造图. 邻接矩阵格式不正确. 点击 \"修正矩阵\" 按钮来修正矩阵或 \"帮助\" 按钮来打开关于邻接矩阵格式的帮助";
$g_lang["bad_inc_matrix_message"] = "无法创造图. 关联矩阵格式不正确. 点击 \"修正矩阵\" 按钮来修正矩阵或 \"帮助\" 按钮来打开关于关联矩阵格式的帮助";
$g_lang["save_image"] = "工作区域截图";
$g_lang["save_full_image"] = "保存图像图片";
$g_lang["save_print_image"] = "打印图像图片(黑白)";
$g_lang["open_saved_image_browser"] = "在浏览器中打开图像";
$g_lang["download_saved_image"] = "下载保存的图像";
$g_lang["save_image_dialog_title"] = "保存图像";
$g_lang["full_report"] = "完整报告";
$g_lang["short_report"] = "短报告";
$g_lang["find_eulerian_loop"] = "寻找欧拉回路";
$g_lang["has_eulerian_loop"] = "图有欧拉回路";
$g_lang["has_not_eulerian_loop"] = "图没有欧拉回路";
$g_lang["algorithms"] = "算法";
$g_lang["processing"] = "处理中...";
$g_lang["view"] = "查看";
$g_lang["view_keys"] = "使用 \"w\", \"a\", \"s\", \"d\" 键移动.";
$g_lang["zoom_fit"] = "缩放合适";
$g_lang["zoom_in"] = "放大";
$g_lang["zoom_out"] = "缩小";
$g_lang["move_workspace"] = "移动工作区";
$g_lang["custom"] = "自定义文本";
$g_lang["enter_vertex_title"] = "输入标题";
$g_lang["rename_vertex"] = "重命名顶点";
$g_lang["rename_text"] = "重命名";
$g_lang["m_title"] = "在线创造图并寻找最短路或使用其他算法";
$g_lang["m_keyWords"] = "在线画图, 寻找最短路, 图可视化, 使用邻接矩阵画图, 邻接矩阵, 关联矩阵, 寻找连通块, 欧拉回路, 最小生成树";
$g_lang["m_description"] = "在线创造图并运用算法: 寻找最短路, 寻找邻接矩阵, 寻找最小生成树以及其他";
$g_lang["current_language"] = "ch";
$g_lang["developer_tools_title"] = "创造算法";
$g_lang["developer_tools_text"] = "在下面黏贴你的算法并运行";
$g_lang["developer_tools_run"] = "运行";
$g_lang["developer_tools_submit"] = "提交到网站";
$g_lang["algorithm_was_sent"] = "算法已提交";
$g_lang["your_algorithm_was_sent"] = "您的算法已提交并将被检查。如果成功将会被添加到网站. ";
$g_lang["edit_weight"] = "修改权重";
$g_lang["group_rename"] = "组重命名";
$g_lang["enter_vertices_text_in_each_line"] = "使用分开的行为每个顶点添加文本";
$g_lang["or"] = "或";
$g_lang["vote"] = "投票";
$g_lang["vote_question"] = "您希望我们先添加什么功能?";
$g_lang["what_algorithm_need"] = "请告诉我们您希望本网站提供什么算法?";
$g_lang["recommend_algorithm"] = "推荐算法";
$g_lang["what_algorithm_we_have"] = "我们的服务支持: <a href=\"/en/wiki/Help/FindTheShortestPath\" target=\"_blank\" style=\"text-decoration: underline\">使用 Dijkstra算法找最短路</a>, <a href=\"/en/wiki/Help/AdjacencyMatrix\" target=\"_blank\" style=\"text-decoration: underline\">邻接矩阵</a>, <a href=\"/en/wiki/Help/IncidenceMatrix\" target=\"_blank\" style=\"text-decoration: underline\">关联矩阵</a>.";
$g_lang["has_eulerian_path"] = "图有欧拉路径";
$g_lang["has_not_eulerian_path"] = "图没有欧拉路径";
$g_lang["min_dist_matrix_description"] = "最短距离图";
$g_lang["graphOfMinDist"] = "最短距离图";
$g_lang["checkToSave"] = "保存";
$g_lang["showDistMatrix"] = "显示距离矩阵";
$g_lang["distMatrixText"] = "距离矩阵";
$g_lang["selectStartVertexForMaxFlow"] = "选择最大流的源点";
$g_lang["selectFinishVertexForMaxFlow"] = "选择最大流的汇点";
$g_lang["maxFlowResult"] = "最大流从 %2 到 %3 等于 %1";
$g_lang["flowNotExists"] = "从 %1 到 %2 的流不存在";
$g_lang["sourceVertex"] = "源点";
$g_lang["sinkVertex"] = "汇点";
$g_lang["export_graph"] = "导出到文件";
$g_lang["import_graph"] = "从文件导入";
$g_lang["has_hamiltonian_path"] = "图有哈密顿路径";
$g_lang["has_not_hamiltonian_path"] = "图没有哈密顿路径";
$g_lang["has_hamiltonian_loop"] = "图有哈密顿回路";
$g_lang["has_not_hamiltonian_loop"] = "图没有哈密顿回路";
$g_lang["start_traversal"] = "选择遍历起点";
$g_lang["traversal_order"] = "遍历顺序: ";
$g_lang["curve_edge"] = "边弯曲";
$g_lang["undo"] = "撤销";
$g_lang["opensource_message"] = "我们的项目目前已经开. 更多细节...";
$g_lang["settings"] = "Settings";
$g_lang["common_vertex_settings"] = "常规顶点";
$g_lang["selected_vertex_settings"] = "选择顶点";
$g_lang["common_edge_settings"] = "常规边";
$g_lang["selected_edge_settings"] = "选择边";
$g_lang["common_color"] = "常规颜色";
$g_lang["stroke_color"] = "边框颜色";
$g_lang["stroke_size"] = "厚度";
$g_lang["text_color"] = "文本颜色";
$g_lang["save_graph"] = "保存图";
$g_lang["default"] = "默认";
$g_lang["vertex_draw_style"] = "顶点格式";
$g_lang["text_background"] = "文本背景";
$g_lang["edge_draw_style"] = "边的格式";
$g_lang["color"] = "颜色";
$g_lang["alpha"] = "透明度";
$g_lang["background_style"] = "背景颜色";
$g_lang["adjacency_matrix_multigraph_description"] = "多重图包含最短边的权重.";
$g_lang["graph_is_multi_message"] = "多重图不支持所有算法";
$g_lang["graph_is_general_message"] = "";
$g_lang["replace_edge"] = "替换流";
$g_lang["add_edge"] = "添加 (多重图)";
$g_lang["greek_add"] = "<a class=\"ProgresssBarLink\" href=\"/nl/\" target=\"_blank\">
我们添加了中文翻译 🇳🇱. 感谢 Xingyi Zhang</a>";
$g_lang["text_above_edge"] = "边上的文本";
$g_lang["select_groupe_mac"] = "使用 Cmd⌘ 选择数个对象.";
$g_lang["select_groupe_win"] = "使用 Ctrl 选择数个对象.";
$g_lang["drag_select_group"] = "拖曳组.";
$g_lang["copy_select_group"] = "复制组";
$g_lang["remove_select_group"] = "删除组";
$g_lang["bfs_name"] = "广度优先搜索";
$g_lang["coloring_name"] = "图着色";
$g_lang["find_connection_component_name"] = "寻找连通块";
$g_lang["dfs_name"] = "深度优先搜索";
$g_lang["eulerin_loop_name"] = "寻找欧拉回路";
$g_lang["eulerin_path_name"] = "寻找欧拉路径";
$g_lang["fiold_name"] = "Floyd–Warshall 算法";
$g_lang["graph_reorder_name"] = "排列图";
$g_lang["hamiltoian_cycle_name"] = "寻找哈密顿回路";
$g_lang["hamiltonian_path_name"] = "寻找哈密顿路径";
$g_lang["max_flow_name"] = "找最大流";
$g_lang["minimum_spanning_tree"] = "找最小生成树";
$g_lang["modern_graph_style_name"] = "根据权重的可视化";
$g_lang["radius_and_diameter_name"] = "找图的半径和直径";
$g_lang["find_short_path_name"] = "用Dijkstra算法找最短路";
$g_lang["vertices_degree_name"] = "计算顶点的度";
$g_lang["min_spanning_tree_res_is"] = "最小生成树的权重是 ";
$g_lang["min_spanning_tree_ignore_direction"] = "在计算式我们忽略了边的方向.";
$g_lang["min_spanning_tree_graph_not_connected"] = "图不连通";
// IsomorphismCheck.js
$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'] = "使用本算法, 你需要两个分开的图";
$g_lang['isomorphism_check'] = "检查同构图";
// RadiusAndDiameter.js
$g_lang['graph_is_disconnected'] = "图是非连通图";
$g_lang['graph_is_trivial'] = "图只包含一个顶点";
$g_lang['graph_radius'] = "图的半径";
$g_lang['graph_diameter'] = "图的直径";
$g_lang['vertex_central'] = "中心";
$g_lang['vertex_peripheral'] = "边缘";
// VerticesDegree.js
$g_lang['maximum_degree_of_graph'] = "图的最大度是";
// Coloring.js
$g_lang['color_number'] = "颜色数量是";
$g_lang['done'] = "完成";
$g_lang['action'] = "行动";
$g_lang['common_edge_style'] = "常规边格式";
$g_lang['selected_edge_style'] = "选择边格式";
$g_lang['common_vertex_style'] = "常规顶点格式";
$g_lang['selected_vertex_style'] = "选择顶点格式";
$g_lang['shape'] = "形状";
$g_lang['circle'] = "圆";
$g_lang['squere'] = "方形";
$g_lang['triangle'] = "三角形";
$g_lang['pentagon'] = "五边形";
$g_lang['vertex_diameter'] = "顶点大小";
$g_lang['additional_text_color'] = "其他文本颜色";
$g_lang['center'] = "中心";
$g_lang['on_up'] = "上";
$g_lang['weight_position'] = "权重位置";
$g_lang['text_position'] = "文本位置";
$g_lang['line_style'] = "边的格式";
$g_lang['edge_width'] = "边宽";
$g_lang['selected_index'] = "选择组";
$g_lang['all'] = "所有";
//FindAllPatches.js
$g_lang['find_all_pathes'] = "找所有路";
$g_lang['number_of_pathes_from'] = "所有路的数量从 ";
$g_lang['to'] = " 到 ";
$g_lang['are'] = " 是 ";
$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'] = "路线至 ";
?>

16
lang/ch/main_tpl.php Normal file
View File

@ -0,0 +1,16 @@
<?php
$g_lang["menu_0"] = "主页";
$g_lang["menu_1"] = "创造图";
$g_lang["menu_2"] = "帮助";
$g_lang["menu_3"] = "联系";
$g_lang["menu_4"] = "使用邻接矩阵";
$g_lang["menu_5"] = "使用关联矩阵x";
$g_lang["menu_6"] = "Wiki";
$g_lang["menu_7"] = "快速开始";
$g_lang["menu_8"] = "新闻";
$g_lang["menu_9"] = "使用图的例子";
$g_lang["menu_10"] = "开源";
$g_lang["footer_info"] = "<a href=\"/en/\">Graph Online</a>&nbsp;是一个在线项目为了帮助&nbsp;创造和可视化图 <a href=\"/en/\">寻找最短路</a>. 你也可以创造使用&nbsp;<a href=\"http://graphonline.ru/en/create_graph_by_matrix\">邻接矩阵创造图</a>.&nbsp;<a href=\"/en/about\">关于项目</a> 和 <a href=\"http://graphonline.ru/en/help\">帮助页面</a>.\n";
$g_lang["lang"] = "语言";
?>

5
lang/ch/main_tpl/page_btns.php Normal file
View File

@ -0,0 +1,5 @@
<?php
$g_lang['home_notg'] = '主页';
$g_lang['back_notg'] = '返回';
?>

11
lang/ch/news.php Normal file
View File

@ -0,0 +1,11 @@
<?php
$g_lang["head_no_tags"] = "新闻和更新";
$g_lang["text"] = "<p>在我们的Facebook页面上寻找更新</p>\n";
$g_lang["m_title"] = "Graph Online的新闻";
$g_lang["m_keyWords"] = "graph online, 新闻, 图,寻找路";
$g_lang["m_description"] = "Graph Online的新闻";
$g_lang["current_language"] = "ch";
?>

6
lang/ch/opensource.php Normal file
View File

@ -0,0 +1,6 @@
<?php
$g_lang["head_no_tags"] = "Graphonline 开源";
$g_lang["text"] = "<p>Graphonline 目前是一个开源项目. 你可以在 github找到源代码: <a href=\"https://github.com/UnickSoft/graphonline\">https://github.com/UnickSoft/graphonline</a>. 我们有计划添加很多新功能，但是由于我们的团队比较小实现它们很慢.</p>\n\n<h2>您可以帮助我们</h2>\n\n<p>如果你知道编程语言: php 或 JavaScript 或 C++, 可以提升Graphonline的服务. 请在github上联系我们或者写邮件至 <a href=\"mailto:admin@graphonline.ru\">admin@graphonline.ru</a>. 如果你是一名学生, 这是一个很好的与开发团队工作的机会.</p>\n\n<p>您也可以帮助我们填充我们的wiki: <a href=\"https://graphonline.ru/en/wiki/\">https://graphonline.ru/en/wiki/</a>. 或者提升我们的设计. 或测试新功能.所以，如果您愿意为graphonline每周花一小时, 请联系我们.</p>\n";
?>