nilooy5 Goto Github PK

coroutines-in-unity

covid19-data-analysis

Covid19 data analysis and forecasting

cpu-time-analyzer-for-threesum

croc

Easily and securely send things from one computer to another :crocodile: :package:

cutoff-to-insertion-sort

cv-tutorials

Computer Vision codes for practice

cycles-in-a-directed-graph

an algorithm to determine cycles in a directed graph from algs4

dalle-mini-python-app

Create your own DALL-E application in Python with Streamlit.

dalle-playground

A playground to generate images from any text prompt based on OpenAI's DALL-E https://openai.com/blog/dall-e/

data-analysis-with-tkinter

It has some basic programming problems as well as displaying data in a Tkinter window

deep-learning

Repo for the Deep Learning Nanodegree Foundations program.

deep-learning-specialization

This repository contains the programming assignments and slides from the deep learning course from coursera offered by deeplearning.ai

depth-first-paths-search-for-a-vertex

Depth First Paths Search for a Vertex in simple java

deque

A double-ended queue or deque (pronounced “deck”) is like a stack or a queue but supports adding and removing items at both ends. A deque stores a collection of items and supports the following API: public class Deque<Item> implements Iterable<Item> Deque() create an empty deque boolean isEmpty() is the deque empty? int size() number of items in the deque void pushLeft(Item item) add an item to the left end void pushRight(Item item) add an item to the right end Item popLeft() remove an item from the left end Item popRight() remove an item from the right end

dfs-for-directed-graph

java code for Determining Depth First Search for a Directed Graph

directed-graph

directed graph generation with outputs using java algoCS4 library classes

distinct-pairs-in-an-array

dreampower

DeepNude algorithm fork with improvements.

dsts-assignment-1

dynamic3dgaussians

making 3d visualizations from static images

edge-for-edgeweightedgraph

The Edge class represents a weighted edge in an EdgeWeightedGraph. Each edge consists of two integers (naming the two vertices) and a real-value weight. The data type provides methods for accessing the two endpoints of the edge and the weight. The natural order for this data type is by ascending order of weight. For additional documentation, see Section 4.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

edge-weighted-graph

The EdgeWeightedGraph class represents an edge-weighted graph of vertices named 0 through V – 1, where each undirected edge is of type Edge and has a real-valued weight. It supports the following two primary operations: add an edge to the graph, iterate over all of the edges incident to a vertex. It also provides methods for returning the degree of a vertex, the number of vertices V in the graph, and the number of edges E in the graph. Parallel edges and self-loops are permitted. By convention, a self-loop v-v appears in the adjacency list of v twice and contributes two to the degree of v. This implementation uses an adjacency-lists representation, which is a vertex-indexed array of Bag objects. It uses Θ(E + V) space, where E is the number of edges and V is the number of vertices. All instance methods take Θ(1) time. (Though, iterating over the edges returned by adj(int) takes time proportional to the degree of the vertex.) Constructing an empty edge-weighted graph with V vertices takes Θ(V) time; constructing a edge-weighted graph with E edges and V vertices takes Θ(E + V) time. For additional documentation, see Section 4.3 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

equalarrays

determines equal arrays

facemeshfacegeometry

FaceMeshFaceGeometry for FaceMesh

fake_movie_review_predictor

this project has 1000 fake and real reviews and we are training 4 different models based on our data to predict fake movie reviews

falling-blocks-unity-game

fastbook

The fastai book, published as Jupyter Notebooks

faster-merge-sort

fazal_computer_vision_cnn_birds_detector

firebasebigq