Skip to main content
Artificial Intelligence

About

Ask Question
Tag Info
Info Newest Frequent Score Active Unanswered

For questions about the branching factor of a tree's (or graph's) node, i.e. the number of children of that node (or its outdegree). The time and space complexity of many traditional search algorithms, such as A* or depth-first search, is often given as a function of the branching factor.

There is no tag wiki for this tag … yet!

Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.

All registered users may propose new tag wikis.

(Note that if you have less than 4000 reputation, your tag wiki will be peer reviewed before it is published.)

History Excerpt history