Manikant Kumar devil-cyber

## connected_copmnonet.cpp
#include<iostream>
#include<list>
#include<vector>
using namespace std;

class Graph{
    int V;
    list<int> *l;
public:
    Graph(int v){

## component.cpp
#include<iostream>
#include<vector>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){
        V = v;

## cyclic.cpp
#include<iostream>
#include<vector>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){
        V = v;

## shortest.cpp
#include<iostream>
#include<vector>
#include<queue>
using namespace std;

class Graph{
    int V;
    vector<int> *l;
public:
    Graph(int v){

## cloudSettings
{"lastUpload":"2022-01-10T19:56:28.451Z","extensionVersion":"v3.4.3"}

## tree.c
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
#define MIN(X,Y) ((X) > (Y) ? (Y) : (X))

struct Node{
    int data;
    struct Node *left;
    struct Node *right;

## linkedlist.c
#include<stdio.h>
#include<stdlib.h>

struct Node{
    int data;
    struct Node *next;
};

struct Node *NewNode(int data){
    struct Node *node = (struct Node*)malloc(sizeof(struct Node));

## stack.c
#include<stdio.h>
#include<stdlib.h>
#define INT_MIN -99999999

struct stack{
    int top;
    unsigned int capacity;
    int * arr;
};

## queue.c
#include<stdio.h>
#include<stdlib.h>
#define INT_MIN -999999

struct Queue{
    unsigned int capacity;
    int *arr;
    int front;
    int top;
    int size;

## alexnet.ipynb

      
        
          
            
              
              1 file
            
          
          
            
              
              0 forks
            
          
          
            
              
              0 comments
            
          
          
            
              
              0 stars
            
          
        
        
          
              
          
          
            
                devil-cyber
                / alexnet.ipynb
            
            
              Last active
              June 21, 2021 07:49
            
              
                AlexNet implementation using MXNet
              
          
        
      
        
  
    
    

          
    
        Loading

      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
	#include<iostream>
	#include<list>
	#include<vector>
	using namespace std;

	class Graph{
	int V;
	list<int> *l;
	public:
	Graph(int v){
	#include<iostream>
	#include<vector>
	#include<queue>
	using namespace std;

	class Graph{
	int V;
	vector<int> *l;
	public:
	Graph(int v){
	#include<stdio.h>
	#include<stdlib.h>
	#include<math.h>
	#define MAX(X,Y) ((X) > (Y) ? (X) : (Y))
	#define MIN(X,Y) ((X) > (Y) ? (Y) : (X))

	struct Node{
	int data;
	struct Node *left;
	struct Node *right;
	#include<stdio.h>
	#include<stdlib.h>
	#define INT_MIN -99999999

	struct stack{
	int top;
	unsigned int capacity;
	int * arr;
	};
	#include<stdio.h>
	#include<stdlib.h>
	#define INT_MIN -999999

	struct Queue{
	unsigned int capacity;
	int *arr;
	int front;
	int top;
	int size;