Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Dynamic Programming Graph Shortest Path

Floyd Warshall Algorithm DP-16

The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem. The problem is to find shortest distances between every pair of vertices in a given ...
Dynamic Programming Graph Shortest Path

Bellman–Ford Algorithm DP-23

Given a graph and a source vertex src in graph, find shortest paths from src to all vertices in the given graph. The graph may contain negative weight edges. We have ...
Graph Greedy Kruskal

Kruskal’s Minimum Spanning Tree Algorithm Greedy Algo-2

What is Minimum Spanning Tree? Given a connected and undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices togeth...
Graph Greedy Adobe

Dijkstra’s shortest path algorithm Greedy Algo-7

Given a graph and a source vertex in the graph, find shortest paths from source to all vertices in the given graph. Dijkstra’s algorithm is very similar to Pr...
Graph Greedy Graph Coloring

Graph Coloring Set 2 (Greedy Algorithm)

We introduced graph coloring and applications in previous post. As discussed in the previous post, graph coloring is widely used. Unfortunately, there is no efficient...
Graph Greedy Dijkstra

Dijkstra’s Algorithm for Adjacency List Representation Greedy Algo-8

We recommend to read following two posts as a prerequisite of this post. 1. Greedy Algorithms | Set 7 (Dijkstra’s shortest path algorithm) 2. Graph and it...
Pattern Searching Pattern Searching

Optimized Naive Algorithm for Pattern Searching

Question: We have discussed Naive String matching algorithm here. Consider a situation where all characters of pattern are different. Can we modify the original Naive...
Pattern Searching Modular Arithmetic Modular Arithmetic

Rabin-Karp Algorithm for Pattern Searching

Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume tha...
C C++ Competitive Programming

Array algorithms in C++ STL (all_of, any_of, none_of, copy_n and iota)

From C++11 onwards, some new and interesting algorithms are added in STL of C++. These algorithms operate on an array and are useful in saving time during coding and ...
Java Java-Functions Java-security package

Java Signature getAlgorithm() method with Examples Java Signature getProvider() method with Examples Java Signature toString() method with Examples Java Signature sign() method with Examples Java Signature getInstance(

The getAlgorithm() method of java.security.Signature class is used to return the name of the algorithm for this signature object. Syntax: public final ...

Subscribe to Our Newsletter