Skip to content

Instantly share code, notes, and snippets.

🎯
Focusing

Ravi Kiran Selvam ravikiran0606

🎯
Focusing
Block or report user

Report or block ravikiran0606

Hide content and notifications from this user.

Learn more about blocking users

Contact Support about this user’s behavior.

Learn more about reporting abuse

Report abuse
View GitHub Profile
View heee
https://github.com/ravikiran0606/FoodWasteManagement/invitations
@ravikiran0606
ravikiran0606 / tcget.py
Created Mar 19, 2017 — forked from cou929/tcget.py
Fetch TopCoder problem statement, test cases and expected result of system test. And save these data to file.
View tcget.py
#! /usr/bin/env python
# -*- coding: utf-8 -*-
'''
tcget.py
Kosei Moriyama <cou929@gmail.com>
'''
import BeautifulSoup
@ravikiran0606
ravikiran0606 / mst.cpp
Created Sep 25, 2016
Minimum Spanning Tree : ( Using Prim's Algorithm and Krushall's Algorithm )
View mst.cpp
#include<bits/stdc++.h>
using namespace std;
vector<int>d,parent,mark;
vector< pair<int,int> >edges;
map< pair<int,int> ,int>weight;
vector< vector< pair<int,int> > >graph;
void prim(int s,int n){
@ravikiran0606
ravikiran0606 / SP in Weighted Graph.cpp
Created Sep 25, 2016
Shortest Path in Weighted Graph : (Using Dijkstra)
View SP in Weighted Graph.cpp
#include<bits/stdc++.h>
using namespace std;
vector<int>d;
vector< vector< pair<int,int> > >graph;
vector<bool>mark;
void dijkstra(int s,int n){
int u,i;
@ravikiran0606
ravikiran0606 / SP in Unweighted Graph.cpp
Last active Sep 25, 2016
Shortest Path in Unweighted Graph : ( Using BFS )
View SP in Unweighted Graph.cpp
#include<bits/stdc++.h>
using namespace std;
vector< vector<int> >graph;
vector<int>d;
vector<bool>vis;
void bfs(int s){
int t;
@ravikiran0606
ravikiran0606 / graphsearch.cpp
Last active Sep 25, 2016
Graph Traversals: DFS (Depth First Search) and BFS (Breadth First Search)
View graphsearch.cpp
#include<bits/stdc++.h>
using namespace std;
vector< vector<int> >graph;
vector<bool>vis;
void dfs(int s){
vis[s]=true;
cout<<s<<" ";
@ravikiran0606
ravikiran0606 / DFS.cpp
Created Sep 25, 2016
Graph Traversal : DFS (Depth First Search)
View DFS.cpp
#include<bits/stdc++.h>
using namespace std;
vector< vector<int> >graph;
vector<bool>vis;
void dfsvisit(int s){
vis[s]=true;
cout<<s<<" ";
@ravikiran0606
ravikiran0606 / Segment.cpp
Created Sep 7, 2016 — forked from aajjbb/Segment.cpp
Segment Tree for Range Minimum Query
View Segment.cpp
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <memory>
@ravikiran0606
ravikiran0606 / ExpressionValidation.cpp
Created Aug 21, 2016
C++ Program to check whether the given expression is valid or not:
View ExpressionValidation.cpp
#include<iostream>
#define maxi 1000
using namespace std;
template<class T>
class sstack{
T a[maxi];
int top;
@ravikiran0606
ravikiran0606 / dualstack.cpp
Created Aug 21, 2016
C++ Program to implement two stacks in a single array :
View dualstack.cpp
#include<iostream>
#define maxi 10
using namespace std;
template<class T>
class dualstack{
T a[maxi];
int top1,top2;
You can’t perform that action at this time.