disconnected - the graph is made up of sub-graphs or it is bipartite.
Just a small correction, but a bipartite graph can be connected. Here’s an example of a bipartite connected graph.
edit: That graph is connected because there is a path from every node to every other node. Wolfram alpha does a good job visualizing all the different connected bipartite graphs of size n (for small n’s) at the bottom of the page here.
When the path from every node to every other node is a unique edge, then you have a complete graph.
I received a Tiva C Series Launchpad MCU from a friend and am currently running through some exercises to get comfortable working in an embedded environment
At work, transitioning back to a project I left a couple weeks ago, so a lot of review of things I still remember from before