diff --git a/lang/ch/404.php b/lang/ch/404.php new file mode 100644 index 0000000..b0cdb71 --- /dev/null +++ b/lang/ch/404.php @@ -0,0 +1,7 @@ +抱歉, 服务器上找不到此页面.

\n\n

也许, 这些选项 可以帮助你:

\n\n\n"; + + $g_lang["m_title"] = "404 找不到页面"; +?> \ No newline at end of file diff --git a/lang/ch/_500.php b/lang/ch/_500.php new file mode 100644 index 0000000..af8679f --- /dev/null +++ b/lang/ch/_500.php @@ -0,0 +1,6 @@ + diff --git a/lang/ch/about.php b/lang/ch/about.php new file mode 100644 index 0000000..1c68c98 --- /dev/null +++ b/lang/ch/about.php @@ -0,0 +1,9 @@ +在线画图(Graph Online) 的 作者是 Graphanalyzer的作者. 现在是教育和商业用途的一个在线服务.

\n"; + + $g_lang["m_title"] = "关于在线画图(Graph Online)的服务"; + $g_lang["m_keyWords"] = "在线画图, 寻找最短路, 图可视化"; + $g_lang["m_description"] = "关于在线画图(Graph Online)项目"; +?> \ No newline at end of file diff --git a/lang/ch/autoload/main.php b/lang/ch/autoload/main.php new file mode 100644 index 0000000..63763c4 --- /dev/null +++ b/lang/ch/autoload/main.php @@ -0,0 +1,8 @@ + \ No newline at end of file diff --git a/lang/ch/contacts.php b/lang/ch/contacts.php new file mode 100644 index 0000000..1fc0c2c --- /dev/null +++ b/lang/ch/contacts.php @@ -0,0 +1,9 @@ +请将您的问题发送至 admin@graphonline.ru 或查看 我们的 facebook 网页

"; + + $g_lang["m_title"] = "Graph Online 联系"; + $g_lang["m_keyWords"] = "graph online 联系"; + $g_lang["m_description"] = "联系Graph online的管理员."; +?> diff --git a/lang/ch/create_algorithm.php b/lang/ch/create_algorithm.php new file mode 100644 index 0000000..b75034a --- /dev/null +++ b/lang/ch/create_algorithm.php @@ -0,0 +1,12 @@ +使用JavaScript创造图的算法. 了解更多 阅读 API 文件.

\n"; + $g_lang["m_title"] = "使用JavaScript为graph online创造自己的算法"; + $g_lang["m_keyWords"] = "图, 算法, JavaScript"; + $g_lang["m_description"] = "使用JavaScript为graph online创造算法"; + +?> \ No newline at end of file diff --git a/lang/ch/create_graph_by_incidence_matrix.php b/lang/ch/create_graph_by_incidence_matrix.php new file mode 100644 index 0000000..684920e --- /dev/null +++ b/lang/ch/create_graph_by_incidence_matrix.php @@ -0,0 +1,19 @@ +在本页面您可以输入关联矩阵并创造图

\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 + ← ↑ → ↓ 键在格之间移动."; +?> \ No newline at end of file diff --git a/lang/ch/create_graph_by_matrix.php b/lang/ch/create_graph_by_matrix.php new file mode 100644 index 0000000..46b7b54 --- /dev/null +++ b/lang/ch/create_graph_by_matrix.php @@ -0,0 +1,23 @@ +在本页面您可以输入 邻接矩阵并创造图

\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"] = "使用 + ← ↑ → ↓ 键在格之间移动."; +?> diff --git a/lang/ch/graphs_examples.php b/lang/ch/graphs_examples.php new file mode 100644 index 0000000..480893e --- /dev/null +++ b/lang/ch/graphs_examples.php @@ -0,0 +1,10 @@ +在这里你可以找到一些图的例子, 你可以基于其中的一个来创造自己的图.

\n"; + $g_lang["current_language"] = "ch"; + + $g_lang["m_title"] = "Graph Online: 图的例子"; + $g_lang["m_keyWords"] = "图的例子, 图的集合, 创造图"; + $g_lang["m_description"] = "图例集合"; +?> \ No newline at end of file diff --git a/lang/ch/help.php b/lang/ch/help.php new file mode 100644 index 0000000..f9d5d2e --- /dev/null +++ b/lang/ch/help.php @@ -0,0 +1,9 @@ +

\n

添加 顶点

\n\n

创造一个图你需要 来添加顶点. 选择 «添加 顶点» 并点击工作页面.

\n\n

\"Add

\n\n

 

\n\n

连接顶点

\n\n

连接顶点你需要 选择 «连接顶点» 并选择第一个顶点然后再选择第二个顶点.

\n\n

\"Connect

\n\n

在框中你可以选择加权或者留空来不加权重.你也可以选择图的类型, 例如 有向或者无向.

\n\n

找最短路

\n\n

选择 «找最短路» 在下拉菜单里. 之后选择起点和终点. 如果两点之间有路, 图像上将会显示出来. 我们使用 Dijkstra 算法.

\n\n

\"Find

\n\n

 

\n"; + + $g_lang["m_title"] = "Graph Online 帮助"; + $g_lang["m_keyWords"] = "图, 帮助"; + $g_lang["m_description"] = "Graph online 帮助页面"; +?> \ No newline at end of file diff --git a/lang/ch/home.php b/lang/ch/home.php new file mode 100644 index 0000000..69c144d --- /dev/null +++ b/lang/ch/home.php @@ -0,0 +1,275 @@ +创造图并寻找最短路. 在帮助页面您可以找到视频教程.

\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"] = "并点击工作页面添加顶点. 顶点标序 " . + ""; + $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"] = "我们的服务支持: 使用 Dijkstra算法找最短路, 邻接矩阵, 关联矩阵."; + + $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"] = " +我们添加了中文翻译 🇳🇱. 感谢 Xingyi Zhang"; + $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'] = "路线至 "; +?> diff --git a/lang/ch/main_tpl.php b/lang/ch/main_tpl.php new file mode 100644 index 0000000..7529bad --- /dev/null +++ b/lang/ch/main_tpl.php @@ -0,0 +1,16 @@ +Graph Online 是一个在线项目为了帮助 创造和可视化图 寻找最短路. 你也可以创造使用 邻接矩阵创造图. 关于项目 和 帮助页面.\n"; + $g_lang["lang"] = "语言"; +?> \ No newline at end of file diff --git a/lang/ch/main_tpl/page_btns.php b/lang/ch/main_tpl/page_btns.php new file mode 100644 index 0000000..b314aa2 --- /dev/null +++ b/lang/ch/main_tpl/page_btns.php @@ -0,0 +1,5 @@ + \ No newline at end of file diff --git a/lang/ch/news.php b/lang/ch/news.php new file mode 100644 index 0000000..de384b0 --- /dev/null +++ b/lang/ch/news.php @@ -0,0 +1,11 @@ +在我们的Facebook页面上寻找更新

\n"; + + $g_lang["m_title"] = "Graph Online的新闻"; + $g_lang["m_keyWords"] = "graph online, 新闻, 图,寻找路"; + $g_lang["m_description"] = "Graph Online的新闻"; + + $g_lang["current_language"] = "ch"; +?> diff --git a/lang/ch/opensource.php b/lang/ch/opensource.php new file mode 100644 index 0000000..60a5078 --- /dev/null +++ b/lang/ch/opensource.php @@ -0,0 +1,6 @@ +Graphonline 目前是一个开源项目. 你可以在 github找到源代码: https://github.com/UnickSoft/graphonline. 我们有计划添加很多新功能，但是由于我们的团队比较小实现它们很慢.

\n\n

您可以帮助我们

\n\n

如果你知道编程语言: php 或 JavaScript 或 C++, 可以提升Graphonline的服务. 请在github上联系我们或者写邮件至 admin@graphonline.ru. 如果你是一名学生, 这是一个很好的与开发团队工作的机会.

\n\n

您也可以帮助我们填充我们的wiki: https://graphonline.ru/en/wiki/. 或者提升我们的设计. 或测试新功能.所以，如果您愿意为graphonline每周花一小时, 请联系我们.

\n"; + +?> \ No newline at end of file