Instantly share code, notes, and snippets.

🎯
Focusing

# Ravi Kiran Selvam ravikiran0606

🎯
Focusing
Created March 2, 2018 07:21
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
 https://github.com/ravikiran0606/FoodWasteManagement/invitations
Created March 19, 2017 07:52 — forked from cou929/tcget.py
Fetch TopCoder problem statement, test cases and expected result of system test. And save these data to file.
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
 #! /usr/bin/env python # -*- coding: utf-8 -*- ''' tcget.py Kosei Moriyama ''' import BeautifulSoup
Created September 25, 2016 15:41
Minimum Spanning Tree : ( Using Prim's Algorithm and Krushall's Algorithm )
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
 #include using namespace std; vectord,parent,mark; vector< pair >edges; map< pair ,int>weight; vector< vector< pair > >graph; void prim(int s,int n){
Created September 25, 2016 15:02
Shortest Path in Weighted Graph : (Using Dijkstra)
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
 #include using namespace std; vectord; vector< vector< pair > >graph; vectormark; void dijkstra(int s,int n){ int u,i;
Last active January 3, 2021 20:18
Shortest Path in Unweighted Graph : ( Using BFS )
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
 #include using namespace std; vector< vector >graph; vectord; vectorvis; void bfs(int s){ int t;
Last active September 25, 2016 15:16
Graph Traversals: DFS (Depth First Search) and BFS (Breadth First Search)
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
 #include using namespace std; vector< vector >graph; vectorvis; void dfs(int s){ vis[s]=true; cout<
Created September 25, 2016 14:00
Graph Traversal : DFS (Depth First Search)
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
 #include using namespace std; vector< vector >graph; vectorvis; void dfsvisit(int s){ vis[s]=true; cout<
Created September 7, 2016 01:54 — forked from aajjbb/Segment.cpp
Segment Tree for Range Minimum Query
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
 #include #include #include #include #include #include #include #include #include #include
Created August 21, 2016 08:50
C++ Program to check whether the given expression is valid or not:
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
 #include #define maxi 1000 using namespace std; template class sstack{ T a[maxi]; int top;
Created August 21, 2016 08:47
C++ Program to implement two stacks in a single array :
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
 #include #define maxi 10 using namespace std; template class dualstack{ T a[maxi]; int top1,top2;