Skip to content

Instantly share code, notes, and snippets.

View toinnn's full-sized avatar
🏠
Working from home

toinnn

🏠
Working from home
  • Fortaleza , Ceará
View GitHub Profile
@toinnn
toinnn / OCR.py
Created February 19, 2020 09:55
Por enquanto só tem localizador de texto em imagem
import numpy as np
import cv2
import imutils
import matplotlib.pyplot as plt
import copy as cp
import time
# from cv2.dnn import
from imutils.object_detection import non_max_suppression
@toinnn
toinnn / Busca Dijkstra
Last active April 5, 2019 00:27
GrafoAdjassencia.py , e algoritmo de Busca Dijkstra
from GrafoAdjassencia import Vertice,ListaAdjassencia,Aresta
lista=ListaAdjassencia()
class buscaMenorCaminho :
listaAdjassencia = None
def __init__(self,lista):
self.listaAdjassencia=ListaAdjassencia()
def menorCaminho(self,VA,VB):
import java.util.*;
import java.util.Scanner;
public class Q4{
public static void main(String[] args) {
int n ;
Scanner iui=new Scanner(System.in);
System.out.println("Digite n");
n = iui.nextInt();
int vetor[]=new int[n];
@toinnn
toinnn / JavaPAnA Q4
Created March 13, 2019 20:21
Incompleto
import java.util.*;
import java.util.Scanner;
public class Q4{
public static void main(String[] args) {
int n ;
Scanner iui=new Scanner(System.in);
System.out.println("Digite n");
n = iui.nextInt();
int vetor[]=new int[n];
@toinnn
toinnn / Adjacencia.java
Created March 4, 2019 16:49
GrafoBicicletarAlgoritmoDeAnálise2.0
import java.util.ArrayList;
public class Adjacencia {
Vertice node ;
int PesoAresta;
ArrayList<Integer> Usuarios = new ArrayList();
ArrayList<String> Duracao = new ArrayList();
}
@toinnn
toinnn / Adjacencia.java
Created March 4, 2019 03:13
GrafoBicicletarAlgoritmoDeAnálise
import java.util.ArrayList;
public class Adjacencia {
Vertice node ;
int PesoAresta;
ArrayList<Integer> Usuarios = new ArrayList();
ArrayList<String> Duracao = new ArrayList();
}
@toinnn
toinnn / Grafo.java
Created February 24, 2019 22:26
Grafo por Lista (Estudo de grafos)
import java.util.ArrayList;
import java.util.Iterator;
public class Grafo {
private ArrayList<ArrayList<Integer>> Lista = new ArrayList<ArrayList<Integer>>();
public ArrayList GetLista()
{
return Lista ;
}
public void AddVertice(int a)
{
@toinnn
toinnn / Neuronio
Created August 27, 2018 13:15
Perceptron
"""treinamento"""
Dado1 = [0.1, 0.4, 0.7]
Dado2 = [0.3, 0.7, 0.2]
Dado3 = [0.6, 0.9, 0.8]
Dado4 = [0.5, 0.7, 0.1]
amostra = [Dado1, Dado2, Dado3, Dado4]
d = [1, -1, -1, 1]
"""treinamento"""
import random
@toinnn
toinnn / Raizes enézimas
Created August 13, 2018 01:10
Raízes enésimas , com recursividade
#include <iostream>
#include <math.h>
using namespace std;
float root(float a,float b,float k,float n)//NÃO SEI PQ N FUNCIONA RAIZES N INTEIRAS
{
if(pow(b,n)<a&&k==1)
return root(a,b+1,k,n);
@toinnn
toinnn / HarryQ
Created May 20, 2018 19:39
Algoritmo Resolverdor das Questões do Site-Python
from math import cos,sin ,radians
import scipy.integrate
import numpy as np
def f(teta):
return np.sin(2*teta)+5
I=scipy.integrate.quad(f, 5,55)
print(" {}".format(I))