We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 5a9fd3b commit 7e559b9Copy full SHA for 7e559b9
docs/source/zh/start/low_order/bipartite_graph.rst
@@ -12,7 +12,7 @@
12
13
定义
14
-------------------------
15
-`有向图 <https://en.wikipedia.org/wiki/Bipartite_graph>`_ 可以表示为 :math:`\mathcal{G} = (\mathcal{U}, \mathcal{V}, \mathcal{E})`,
+`二分图 <https://en.wikipedia.org/wiki/Bipartite_graph>`_ 可以表示为 :math:`\mathcal{G} = (\mathcal{U}, \mathcal{V}, \mathcal{E})`,
16
其分为 :math:`\mathcal{U}` 和 :math:`\mathcal{V}` 两部分, 通过二分图内的边 :math:`\mathcal{E}` 连接。
17
18
- :math:`\mathcal{U}` 是一个 **顶点** 集(也可以称为 **节点** 或者 **点**);
0 commit comments