A network can have only one source and one sink.

Related Questions

• A simple acyclic path between source and sink which pass through only positive weighted edges is called?
• You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
• Dijkstra’s Algorithm run on a weighted, directed graph G={V,E} with non-negative weight function w and source s, terminates with d[u]=delta(s,u) for all vertices u in V.
• What is the source?
• Every graph has only one minimum spanning tree.
• Given a string, you have to find the minimum number of characters to be inserted in the string so that the string becomes a palindrome. Which of the following methods can be used to solve the problem?
• You have n dice each having f faces. What is the number of permutations that can be obtained when you roll the n dice together?
• You have 3 dice each having 6 faces. What is the number of permutations that can be obtained when you roll the 3 dice together?
• You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?
• A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)