Math 2.0

definition

Forest

Definition

A forest is an acyclic graph.

Remarks

The connected components of a forest are trees. Thus a forest is a disjoint union of trees. Every tree is a forest. The graph with no edges on nn vertices is a forest with nn components.

Explanations

L1 human

A forest is a graph with no cycles, and it may be in several pieces. Each piece is a tree, as the name suggests.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 10 nodes in this order. The foundations come first, and the list ends with this node.

Graph, definition, no evidence levelGraphdefinitionWalk, definition, no evidence levelWalkdefinitionReachability, definition, no evidence levelReachabilitydefinitionTrail, definition, no evidence levelTraildefinitionConnected graph, definition, no evidence levelConnected graphdefinitionCircuit, definition, no evidence levelCircuitdefinitionCycle, definition, no evidence levelCycledefinitionAcyclic graph, definition, no evidence levelAcyclic graphdefinitionTree, definition, no evidence levelTreedefinitionForest, definition, no evidence levelForestdefinition
Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Graph definition
  2. Walk definition
  3. Reachability definition
  4. Trail definition
  5. Connected graph definition
  6. Circuit definition
  7. Cycle definition
  8. Acyclic graph definition
  9. Tree definition
  10. Forest definition

Sources

  1. Web https://en.wikipedia.org/wiki/Tree_(graph_theory), Forest

What links here

No node links to this node yet.