最終更新日:2022/12/24
The type of graph studied in graph theory is formally described as an ordered pair G=(V,E) comprising a set V of vertices, or nodes, and a set E of pairs (either ordered or unordered) of vertices, each representing an (directed or undirected) edge; if desired, the vertices and/or edges can be labelled.
音声機能が動作しない場合はこちらをご確認ください
編集履歴(0)
元となった例文
The
type
of
graph
studied
in
graph
theory
is
formally
described
as
an
ordered
pair
G=(V,E)
comprising
a
set
V
of
vertices,
or
nodes,
and
a
set
E
of
pairs
(either
ordered
or
unordered)
of
vertices,
each
representing
an
(directed
or
undirected)
edge;
if
desired,
the
vertices
and/or
edges
can
be
labelled.