Math 2.0

definition

Acyclic graph

Definition

A graph is acyclic if it has no cycle.

Remarks

An acyclic graph is also called a forest. A connected acyclic graph is a tree. The path graphs and the graphs with no edges are acyclic. The cycle graphs are not. A finite acyclic graph with nn vertices and cc components has n−cn - c edges.

Explanations

L1 human

A graph is acyclic when you cannot go around any loop in it. Each edge then splits its piece of the graph in two when you delete it.

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 6 nodes in this order. The foundations come first, and the list ends with this node.

Graph, definition, no evidence levelGraphdefinitionWalk, definition, no evidence levelWalkdefinitionTrail, definition, no evidence levelTraildefinitionCircuit, definition, no evidence levelCircuitdefinitionCycle, definition, no evidence levelCycledefinitionAcyclic graph, definition, no evidence levelAcyclic graphdefinition
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. Trail definition
  4. Circuit definition
  5. Cycle definition
  6. Acyclic graph definition

What depends on this

12 nodes use this node, directly or through other nodes.

Sources

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

What links here

Used by