计算是结构化的，以有向图的方式进行：程序是图形顶点，而通道则作为图的边。

The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.

youdao

一个简单的例子是创建这样一个图，顶点表示网站中的网页，而边表示页面指向另一个页面的链接。

One simple example is creating a graph where vertices are represented by a website's pages and edges exist between pages containing links to other pages.

youdao

向一个图片添加两个顶点并将它们通过边连接起来的动作称之为“related _ to”，它是这么实现的。

Adding two vertices to a graph and connecting them through an edge named "related_to" is done as following.

youdao