Last Updated：2025/11/22

(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u.

音声機能が動作しない場合はこちらをご確認ください

See correct answer

strongly connected

Source Word

strongly connected

not-comparable

(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u.

Japanese Meaning

グラフ理論において、有向グラフの全ての頂点の組に対し、互いに到達可能（uからv、vからuへの経路が存在）である状態 / 任意の頂点対について、片方からもう片方へ、かつ逆方向にも経路が存在するグラフの性質

私たちの有向ネットワークでは、その部分グラフは強連結であり、任意の2つの頂点uとvについてuからvへ、またvからuへと到達可能な経路が存在するため、どのノード間でも双方向に情報が流れることができます。

Sense（1）

(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a path from u to v and a path from v to u.

Sense（2）

(graph theory) Of a directed graph, such that for every pair of vertices u and v there is a directed path either from u to v or from v to u.