In graph theory, a tree is an undirected graph where any two vertices are connected by exactly one path; a forest is an undirected graph where vertices are connected by at most one path or can be seen as a combination of multiple trees. A polytree is a directed version of a tree, while a polyforest is a directed version of a forest. Many data structures called trees in computer science have underlying tree structures in graph theory, and these can be rooted with directed or undirected edges; the term "tree" in this context was introduced by mathematician Arthur Cayley in 1857.
Brown University
Spring 2023
CSCI 0220 provides a foundation in discrete math and probability theory. Key topics include logic, set theory, number theory, combinatorics, graph theory, and probability. No prior math background assumed. Aims to develop problem solving, communication, and collaboration skills. Introduces new concepts and ways of thinking to enable analyzing problems arising in computer science. Beginner-friendly introduction to core mathematical concepts underlying many aspects of CS.
No concepts data
+ 26 more concepts