Hey everybody. I want to know the difference, with examples, between a connected graph, a strongly connected graph and a biconnected graph in both directed and undirected graphs. Is a strongly connected graph a connected one?, is a biconnected graph a strongly connected graph?
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga.
Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus.
Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
connected graphs are those in which atleast one pair of nodes are connected with edges.strongly connected graph is the one in which every nodes are connected or u can say that between every pair of nodes,there will exist atleast one path between.(path is interconnection of vertices and edges);then there is weakly connected graph in which atleast there is a node which is not connected or it is isolated