✦ScienexySCIENCE KNOWLEDGE LIBRARY
abbreviation · SCI-REF-007-776

Algorithms Abbreviations

Common short forms used to describe algorithmic methods.

Explanation

Abbreviations

AbbreviationFull FormMeaningUsage ExampleContext

DP

Dynamic Programming

An algorithmic technique that solves problems by reusing solutions to overlapping subproblems.

A Fibonacci implementation can use DP to avoid repeated calculations.

Algorithm design and optimization.

BFS

Breadth-First Search

A graph traversal algorithm that explores vertices level by level.

BFS can find shortest paths in unweighted graphs.

Graph algorithms.

DFS

Depth-First Search

A graph traversal algorithm that explores a path deeply before backtracking.

DFS can be used to explore connected components.

Graph traversal and search.

Example or application

A worked example has not yet been added.

Importance

These abbreviations identify widely used algorithmic techniques for optimization and graph traversal.

Related Topic

  • Algorithms

  • Graph Theory

  • Algorithm Design

Sources and verification

Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.

  • Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.

Suggest a correction or source · More in Scientific Abbreviations & Acronyms