Algorithm

Published on
May 3, 2023
P vs. NP
algorithm
The P-NP problem is an unsolved problem in theoretical computer science regarding whether complexity classes P and NP are equivalent. In brief, it asks whether problems that can be verified quickly can also be solved quickly.
Published on
April 21, 2023
Maximum flow problem
algorithm
Maximum flow problems involve finding a feasible flow through a flow network that maximizes the flow rate.
Published on
April 20, 2023
Shortest path
algorithm
Given a weighted graph and two vertices u and v, find a path of minimum total weight between u and v.
Published on
April 14, 2023
Minimum Spanning Tree (MST)
algorithm
A minimum spanning tree is a spanning tree of a weighted graph with the minimum total edge weight.
Published on
April 12, 2023
DFS vs. BFS
algorithm
DFS and BFS are algorithms used to traverse graphs or trees. However, they differ in the way they explore the graph and the order in which they visit nodes.
Published on
March 12, 2023
Huffman Coding
algorithm
Introduction and implementation of Huffman coding.