Ravi Kiran Selvam ravikiran0606

## DynamicConstructor.cpp
    #include<iostream>

    using namespace std;

    class matrix{
        int **a;
        int m,n;

        public:
            matrix(int x,int y);

## Bankclass.cpp
    #include<iostream>
    #include<string>

    using namespace std;

    class bank{
        string name;
        int acno;
        string actype;
        int balance;

## StringClass.cpp
#include<iostream>
#include<cstring>

using namespace std;

class sstring{
    char* s;
    int len;
    public:
        sstring();

## 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;

## 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;

## heee
https://github.com/ravikiran0606/FoodWasteManagement/invitations

## tcget.py
#! /usr/bin/env python
# -*- coding: utf-8 -*-

'''
tcget.py

Kosei Moriyama <cou929@gmail.com>
'''

import BeautifulSoup

## 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){

## 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<<" ";

## 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<<" ";
	#include<iostream>

	using namespace std;

	class matrix{
	int **a;
	int m,n;

	public:
	matrix(int x,int y);
	#include<iostream>
	#include<string>

	using namespace std;

	class bank{
	string name;
	int acno;
	string actype;
	int balance;
	#include<iostream>
	#include<cstring>

	using namespace std;

	class sstring{
	char* s;
	int len;
	public:
	sstring();
	#include<bits/stdc++.h>

	using namespace std;

	vector< vector<int> >graph;
	vector<int>d;
	vector<bool>vis;

	void bfs(int s){
	int t;
	#! /usr/bin/env python
	# -- coding: utf-8 --

	'''
	tcget.py

	Kosei Moriyama <cou929@gmail.com>
	'''

	import BeautifulSoup
	#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){