WeaklyConnectedGraphQ
Details
- WeaklyConnectedGraphQ works for any graph object.
- A graph is weakly connected if there is a sequence of edges joining every pair of vertices.
- A graph is weakly connected if there is a sequence of edges joining every pair of vertices when the graph is considered undirected.
Examples
open allclose allBasic Examples (2)
Scope (6)
WeaklyConnectedGraphQ gives False for anything that is not a weakly connected graph:
WeaklyConnectedGraphQ works with large graphs:
Wolfram Research (2012), WeaklyConnectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/WeaklyConnectedGraphQ.html.
Text
Wolfram Research (2012), WeaklyConnectedGraphQ, Wolfram Language function, https://reference.wolfram.com/language/ref/WeaklyConnectedGraphQ.html.
CMS
Wolfram Language. 2012. "WeaklyConnectedGraphQ." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/WeaklyConnectedGraphQ.html.
APA
Wolfram Language. (2012). WeaklyConnectedGraphQ. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/WeaklyConnectedGraphQ.html