behaviorOnDisconnectedGraph
P185024
predicate
Indicates how a method, algorithm, or process behaves or produces results when applied to a graph that is not fully connected (i.e., consists of multiple disconnected components).
Sample triples (1)
| Subject | Object |
|---|---|
| Prim's minimum spanning tree algorithm | produces minimum spanning forest ⓘ |