Ask
your own question, for FREE!
Computer Science
12 Online
What is the difference between a tree and a graph?
Still Need Help?
Join the QuestionCove community and study together with friends!
trees have leafs and graphs don't....
A tree is a type of graph that does not have any cycles and there is only one path between any two vertices.
I would say that the two points above are identical for undirected graphs/trees, but I don't think I've ever heard of a directed tree anyway.
A graph is a set of branches and vertices which may or may not contain loops/cycles within it. A tree is a graph which consists of all the vertices of the main graph along with branches(edges) which connect all the vertices together( only once). There can be many trees for a given graph. |dw:1326385889197:dw|
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
abby2blessed:
How do you guys feel about second chances? Concerning relationships, both romantic and otherwise.
TJH:
love Love, it comes, it goes But what if it stayed stayed in the silence the storm stayed when the world was loud for me it's different; it left when it was
Puffer:
General question what came first the chicken or the egg itu2019s a trick question
Bounty:
the world keeps moving fast and I'm stuck in a time lapse all I need is a minute
Bounty:
can I get so tips on how to start my journey into semi-realism art also on how to
Strawberryluna:
Read my poem. Im not for criticism its a poem I wrote after my breakup: Youu2019ll never understand the way you made me break, I hate that I still love you
4 days ago
0 Replies
0 Medals
4 days ago
4 Replies
3 Medals
4 days ago
5 Replies
1 Medal
1 week ago
4 Replies
0 Medals
2 weeks ago
0 Replies
0 Medals
5 days ago
5 Replies
2 Medals