## Number of paths from source to destination in a directed acyclic graph

Given a Directed Acyclic Graph with n vertices and m edges. The task is to find the number of different paths that exist from a… Read More »

- Top 10 algorithms in Interview Questions
- Topological Sorting
- Top 10 Algorithms and Data Structures for Competitive Programming
- Given a sorted dictionary of an alien language, find order of characters
- Kahn's algorithm for Topological Sorting
- Longest Path in a Directed Acyclic Graph
- Shortest Path in Directed Acyclic Graph
- All Topological Sorts of a Directed Acyclic Graph
- Longest path between any pair of vertices
- Find the minimum cost to reach destination using a train
- Find Itinerary from a given list of tickets
- Assign directions to edges so that the directed graph remains acyclic
- Longest Path in a Directed Acyclic Graph | Set 2
- Maximum edges that can be added to DAG so that is remains DAG
- Topological Sort of a graph using departure time of vertex
- Number of paths from source to destination in a directed acyclic graph
- Find alphabetical order such that words can be considered sorted

Given a Directed Acyclic Graph with n vertices and m edges. The task is to find the number of different paths that exist from a… Read More »

Given an array of words, find any alphabetical order in the English alphabet such that the given words can be considered sorted (increasing), if there… Read More »

A DAG is given to us, we need to find maximum number of edges that can be added to this DAG, after which new graph… Read More »

We are given a map of cities connected with each other via cable lines such that there is no cycle between any two cities. We… Read More »

Given a Weighted Directed Acyclic Graph (DAG) and a source vertex in it, find the longest distances from source vertex to all other vertices in… Read More »

Given a Directed Acyclic Graph (DAG), find Topological Sort of the graph. Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices… Read More »

Topological sorting for Directed Acyclic Graph (DAG) is a linear ordering of vertices such that for every directed edge uv, vertex u comes before v… Read More »

In this post “Important top 10 algorithms and data structures for competitive coding “. Topics : Graph algorithms Dynamic programming Searching and Sorting: Number theory… Read More »

In this post “Top 10 coding problems of important topics with their solutions ” are written. If you are preparing for a coding interview, going through… Read More »

Given a list of tickets, find itinerary in order using the given list. Example: Input: “Chennai” -> “Banglore” “Bombay” -> “Delhi” “Goa” -> “Chennai” “Delhi”… Read More »

Given a graph with both directed and undirected edges. It is given that the directed edges don’t form cycle. How to assign directions to undirected… Read More »

There are N stations on route of a train. The train goes from station 0 to N-1. The ticket cost for all pair of stations… Read More »

Given a sorted dictionary (array of words) of an alien language, find order of characters in the language. Examples: Input: words[] = {“baa”, “abcd”, “abca”,… Read More »

Given a Weighted Directed Acyclic Graph (DAG) and a source vertex s in it, find the longest distances from s to all other vertices in… Read More »