This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| <script type="text/javascript" src="jquery-2.1.4.min.js"></script> | |
| <script type="text/javascript"> | |
| function sendOTP() { | |
| var data = {"countryCode": "country code", "mobileNumber": "Mobile number to be verified"}; | |
| $.ajax({ | |
| url: 'http://Your-domain-name/path/sendotp.php?action=generateOTP', | |
| type: 'POST', | |
| dataType: 'json', | |
| data: data, |
rajeakshay
/ AllPathsFromASource.java
Created
September 23, 2016 05:03
Print all paths from a given source to a destination - (http://www.geeksforgeeks.org/find-paths-given-source-destination/) Given a directed graph, a source vertex ‘s’ and a destination vertex ‘d’, print all paths from given ‘s’ to ‘d’.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Print all paths from a given source to a destination - (http://www.geeksforgeeks.org/find-paths-given-source-destination/) | |
| * Given a directed graph, a source vertex ‘s’ and a destination vertex ‘d’, print all paths from given ‘s’ to ‘d’. | |
| * */ | |
| import java.util.*; | |
| public class AllPathsFromASource { | |
| static class Graph{ | |
| int V; | |
| Map<Integer, List<Integer>> adj; // Adjacency list | |