thinkphp

import java.io.*;
import java.util.*;

class GraphAdjLinkedList {

      private static class Node {

          int vecin;
          Node urmator;

thinkphp

import java.util.Scanner;
/*
0 1
liste de adiacenta:

cap[]

1: 2, 3  cap[1]
2: 1, 5,4 cap[2]
3: 1, 5   cap[3]

thinkphp

import  java.util.*;

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

	   public final boolean[] vizitat;

	   private final int n;

thinkphp

import java.io.*;
import java.util.*;

class GraphAdjMatrix {

       private int[][] mat;
       private boolean[] vizitat;
       private int n;

       public GraphAdjMatrix(int n) {

thinkphp

public class DoublyLinkedList {

     static class Node {

          int data;
          Node next;
          Node prev;

          Node(int data) {
               this.data = data;

thinkphp

/*
LRU Cache capacitate 5

  MostRecently U             Least Recenty Used
HEAD(-1) 9 <-> 10 <-> 1 <-> 5 <-> 2(-1)TAIL

Put(5)

get(1)

thinkphp

https://web.stanford.edu/class/cs97si/06-basic-graph-algorithms.pdf
 

thinkphp

#include <stdio.h>
#define MAX 105
#define FIN "royfloyd.in"
#define FOUT "royfloyd.out"

//function prototypes
void read();
void RoyFloyd();
void write();

thinkphp

#include <bits/stdc++.h>
#define FIN "cautbin.in"
#define FOUT "cautbin.out"
using namespace std;

//returns the largest index such that arr[i] == key
// or -1 whether the key is not in the array
int binary_search0(int *arr, int lo, int hi, int key) {

    if(lo > hi) {

thinkphp

#include <iostream>
#include <unordered_map>
/*
capacity = 5
Head 11 8 5 1 4 Tail

tail->prev inseamna nodul cu key 7

head->next = inseamna nodul cu key 8