「finite」の共起表現一覧(1語右が「undirected」)
該当件数 : 8件
| ch (BFS) is another technique for traversing a | finite undirected graph. |
| t search (DFS) is a technique for traversing a | finite undirected graph. |
| Let G be a | finite undirected graph and x and y two distinct vert |
| Let G be a | finite undirected graph and x and y two nonadjacent v |
| above definition a graph is understood to be a | finite undirected simple graph. |
| heorem is a basic result about connectivity in | finite undirected graphs. |
| handshaking lemma is the statement that every | finite undirected graph has an even number of vertice |
| rms a partial order on the set of all distinct | finite undirected graphs, as it obeys the three axiom |
こんにちは ゲスト さん
ログイン |
Weblio会員(無料)になると
|
検索履歴を保存できる！
こんにちは ゲスト さん
|
ログイン |
Weblio会員(無料)になると
|
