undirected graph
- noun
- /ˌʌn.dɪˈrɛk.tɪd ɡræf/
- Specialized
:
grafo no dirigido
- In an undirected graph, each edge connects two vertices without any direction.
Examples
-
This latter assumption is reasonable in many cases: for example, if G is an undirected graph built from messages sent and received, then each user in X knows its incident edges.
Academic text (2011) -
For each subject, a 90-node, scale-specific, undirected graph of the functional connectivity network was constructed by thresholding the wavelet correlation matrix computed at that scale.
Blog text (4) -
How funny that in undirected graphs you can have a backward.
-
Because insert when we're maintaining an undirected graph, there is no rootedness.
-
So right, the input is an undirected graph G equals VE.
-
We can represent friendships among people as an undirected graph, where each connection is mutual.
-
To analyze the road system, we used an undirected graph where roads between cities had no defined direction.
Surface Forms
Morphology
undirected + graph
The phrase is fully compositional: 'undirected' (without direction) modifies 'graph' to indicate a graph whose edges lack orientation. This adjective + noun construction directly yields the technical meaning, so a B1 learner who knows both constituents can reasonably infer the MWE's meaning.
Etymology
Undirected graph comes from a simple picture: the word graph means a picture of dots and lines and undirected means the lines have no arrows, so the lines do not 'point' one way. That's why an undirected graph describes connections that can go both ways, not one-way links.
