thinkphp

/*
Ciclul hamiltonian se poate determina folosind spatiul permutarilor filtrate de matricea de adiacenta a grafului.

Input:
numar de noduri si nodul de start
5 1
0 1 0 0 1
1 0 1 1 0
0 1 0 1 1
0 0 1 0 1

thinkphp

Un graf este reprezentare abstracta a conectivitatii folosind Nodes si Edges;


- 1...N
- Nodurile si Muchiile sau arcele au informatii
- grafurile : orientate si neorientate
- edges conecteaza m perechi de noduri


Graf = orice multime finita V (Vertices), prevazuta cu o relatie binara interna E

thinkphp

#include <iostream>

class DoublyLinkedList {

	  struct Node {
	  	  int data;
	  	  struct Node *next;
	  	  struct Node *prev;
	  	  Node(int d): data(d), next(nullptr), prev(nullptr){}	  	  
	  };

thinkphp

I'm a highly skilled Front End / Back End Developer coupled with a keen enthusiasm for Design Patterns, learning and using new technologies.  I have a passion for breaking down complex technical concepts and presenting them in an understandable format to various audiences. My interests lie at the intersection of algorithm design techniques and optimization, where I am passionate about developing efficient solutions to complex computational problems. I'm Interested in design and implementation of programming languages , categorical semantics, theory of computation ( Big O Notation, Computability), Distributed Processing, Data Mining, Advanced Topics in Machine Learning, Deep Learning, IaaS, PaaS, SaaS, functional programming, Natural Language Processing (parsing, mathematical developments and applications, pattern interpretation, tree-controlled grammars), statistics.

I contributed to MooTools Plugins as part of the development of the MooTools Forge package repository https://mootools.net/forge/profile/thinkp

thinkphp

import javax.swing.*;
import java.awt.*;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;

public class Main extends JFrame implements ActionListener {
    int choice = 0, choice1 = 0, choice2 = 0;
    JFrame f1, f2;
    JPanel p1, p2, p3;

thinkphp

import  java.util.*;

public class Graf {
	
	   private final int[][] mat;

	   public final boolean[] vizitat;

	   private final int n;

thinkphp

/*
Grafuri
-------

Graf <=> orice multime finita V, prevazuta cu o relatie binara interna E

G = (V,E)

V = numarul de noduri
E = numarul de muchii

thinkphp

import java.io.*;       

public class editDistance {


static void main(String[] args) {

       BufferedReader br = new BufferedReader(new InputStreamReader(System.in)) ;
       BufferedReader s = br.readLine();       
       BufferedReader d = br.readLine();

thinkphp

import java.util.*;
/*
-------------------------------------
Edit Distance = Distanta Levenshstein
-------------------------------------


Distanta Levenshtein este o masura care cuantifica cat de diferite sunt doua siruri de caractere
prin numarul minim de operatii necesare ptrneu a transforma un sir in altil.

thinkphp

A x Point(1)


B x Point(2)


C x Point(3)