Obiective:

• cunoasterea si utilizarea adecvata a notiunilor specifice limbajului utilizat in teoria grafurilor;
• explicarea si interpretarea unor idei, proiecte, procese, precum si a continuturilor teoretice si practice ale teoriei grafurilor;
• proiectarea, implementarea si evaluarea unor aplicatii ale grafurilor in diverse domenii;
• deprinderea metodelor directe si indirecte, specifice rezolvarii problemelor matematice;

Continutul laboratorului:

• Laboratorul 1
  1. Lucrul cu fisiere - doc
  2. Exemplu de proiect - arhiva
  3. Exercitii - doc
  1. Matrice - program * matrice.in
  2. Alfanumeric - program * alfanumeric.in
  3. Cuvinte - program v1 * program v2 * cuvinte.in
  4. Balcon - program * balcon.in
  5. Simetrie - program * simetrie.in
  6. Numar triunghiuri - program v1 * program v3 * nrtri.in
  7. (*) Carti - carti.in
  8. (*) Jetoane - jetoane.in
  9. Paranteze - program * paranteze3.in
  10. (*) Parcurgere matrice Em - em.in


• Laboratorul 2 - Metode de reprezentare. Parcurgere in latime.
  1. Exercitii - doc
  1. Facebook - facebook.in
  2. BFS - program v1 * program v2 - wrong output * program v2 * program v3 * BFS.in
  3. DMax - dmax.in
  4. Epidemie - epidemie.in
  5. Feisbuc - program * feisbuc.in
  6. Facebook2 (Facebook_FMI) - fb_fmi.in
  7. Camelot - camelot.in
  8. Lant maxim - lantmaxim.in
  9. Graf partial - graf_partial_1.in


• Laboratorul 3 - Parcurgere in adancime. Componente conexe. Muchie critica.
  1. Exercitii - doc
  1. DFS - program v1 * program v2 * program v3 * dfs.in
  2. Conex - program * conex.in
  3. Componente conexe - componenteconexe.in
  4. Componente conexe 2 - varianta 1 * componenteconexe2.in
  5. Retea - retea.in
  6. Arrows - arrows.in
  7. (*) Dirty - dirty.in
  8. Partial - partial.in
  9. Bipartit - bipartit1.in
  10. (*) Componente biconexe - componentebiconexe.in
  11. Knight's tour - program v1 * program v2 * knightstour.in


• Laboratorul 4 - Grafuri euleriene. Grafuri hamiltoniene.
  1. Exercitii - doc
  1. Ciclu eulerian - program * euler.in
  2. Fazan - program * fazan.in
  3. Hamilton - program v1 * program v2 * hamilton.in
  4. Drum hamiltonian - drum_hamiltonian.in
  5. Domino - domino.in
  6. (*) Depot - teste depot
  7. (*) Eulerian path - enunt
  2. Problema postasului chinez * notite


• Laboratorul 5 - Arbori binari. Arbori binari de cautare.
  1. Exercitii - doc
  1. Preordine - program * preordine.in
  2. Inordine - program * inordine.in
  3. Postordine - program v1 * program v2 * postordine.in
  4. Countsub - program v1 * program v2 * countsub.in
  5. Bifrunze - bifrunze.in
  6. Countprimsub - countprimsub.in
  7. Nivelebin - nivelebin.in
  8. Inaltime - program * inaltime1.in
  9. kNivel - knivel1.in
  10. Bilatime - program * bilatime.in
  11. Colegi - colegi.in
  12. (*) Binar - binar.in
  13. Counting Stars - enunt
  14. Money Matters - enunt


• Laboratorul 6 - Heap-uri. Arbori oarecare.
  1. Exercitii - doc
  1. Heapsort - program v1 * program v2 * heapsort.in
  2. Heap - heap.in
  3. Competitie - program * competitie.in
  4. Frunze - program * frunze.in
  5. Nivele - nivele.in
  6. Inaltime - inaltime.in
  7. Subarbore - program v1 * program v2 * subarbore.in
  8. DetDrum - detdrum.in
  9. DetDrum2 - program * detdrum2.in
  10. Arbore - arbore.in
  11. Bomboane2 - bomboane2.in
  12. Ierarhie - ierarhie.in
  13. (*) Prepost - prepost.in
  14. (*) Pom - pom.in
  15. Interclasari - source - interclasari.in
  16. (*) Stock prices - enunt
  17. (*) Continuous median - enunt


• Laboratorul 7 - Algoritmul lui Prim. Algoritmul lui Kruskal.
  1. Exercitii - doc
  1. Prim - program v1 * program v2 * prim.in
  2. Kruskal - program * kruskal.in
  3. Zapada - program * zapada.in
  4. Componente conexe 4 - componenteconexe4.in
  5. (*) Cotoroanta - cotoroanta.in
  6. (*) Channels - channels.in
  7. (*) Flota - program * flota.in
  8. (*) Meta - meta.in
  9. (*) Recon - recon.in
  10. Ninjago - ninjago.in
  11. Componente conexe 2 (din Laboratorul 3) - varianta 2 * componenteconexe2.in


• Laboratorul 8 - Grafuri orientate. DFS. Sortare topologica.
  1. Exercitii - doc
  1. Grade2 - program * grade2.in
  2. Cunoscuti - program * cunoscuti.in
  3. AfisCircuite - program * afiscircuite.in
  4. Turneu - turneu.in
  5. Drumuri - drumuri.in
  6. Mall - mall.in
  7. TopSort - Kahn * DFS * topsort.in
  8. (*) Coborare - coborare.in
  9. Orase - orase.in
  10. Project Management - pm.in
  11. (*) Build dependencies - enunt


• Laboratorul 9 - Algoritmul lui Kosaraju. Algoritmul lui Tarjan.
  1. Exercitii - doc
  1. Tare conexitate - Kosaraju * Tarjan * tareconexitate.in
  2. Anunt - program * anunt.in
  3. (*) Porumbei - porumbei.in
  4. (*) Matroid - matroid.in
  5. Nuclee - nuclee.in
  6. Anarhie - anarhie.in
  7. Complet - complet.in
  8. Graf - graf.in
  9. Gasti - gasti.in
  10. (*) Pacman - pacman.in
  11. (*) Reversing Roads - enunt


• Laboratorul 10 - Distante in grafuri (I).
  1. Exercitii - doc
  1. Diametru - program * diametru.in
  2. Dijkstra - program v1 * program v2 * dijkstra.in
  3. (*) Traveling - traveling.in
  4. Drum - drum.in
  5. Dijkstra2 - dijkstra2.in
  6. (*) Capitala - capitala.in
  7. Parc - parc.in
  8. Festivaluri - program * festivaluri.in
  9. Graph - graph.in
  10. Zana - program * zana.in
  11. (*) Robotel - robotel.in
  12. Bellman - Ford - exemplu
  13. (*) Through the Grapevine - enunt
  14. (*) Bumped - enunt
  15. (*) SSSP, negative weights - enunt


• Laboratorul 11 - Distante in grafuri (II).
  1. Exercitii - doc
  1. Roy-Floyd - program * roy-floyd.in
  2. Traseu - program * traseu.in
  3. Roy-Warshall - program * roy-warshall.in
  4. Firma - firma.in
  5. Dragoni - dragoni.in
  6. (*) Biscuit - biscuit.in
  7. Bellman Ford - bellmanford.in
  8. Ciclu - ciclu.in
  9. RF - rf.in
  10. Retea1 - retea1.in
  11. (*) All Pairs Shortest Path - enunt
  12. (*) Import spaghetti - enunt

Aplicatii:

1. Facebook Graph API
   1. Overview
   2. Using the Graph API
   3. Fetch Facebook page’s feed
   4. Facebook Graph API tutorial
2. PageRank
   1. PageRank explained in simple terms
   2. Google's PageRank Algorithm
   3. PageRank Algorithm - The Mathematics of Google Search
   4. Study of Page Rank Algorithm
3. Graph-based spam/fraud detection
4. Algoritmi de routare in retea
   1. How Routing Algorithms Work
   2. Network Routing
   3. Networking: Routing Algorithms
5. Graphs in molecular biology
6. Google Maps
   1. How does the algorithm of Google Maps work?
   2. Is Dijkstras algorithm used in modern route-finding systems?
   3. How a GPS Calculates Routes
   4. Fast Shortest Path Algorithm for Road Network and Implementation
7. Optimal Path Choice in Railway Passenger Travel Network
8. Graph database
   1. What is a Graph Database?
   2. Getting Started
   3. Getting Started with Data Analysis using Neo4j
9. A Study on Course Timetable Scheduling using Graph Coloring Approach

1. M. Cosulschi, Algoritmica grafurilor si aplicatii, Editura Universitaria, Craiova, 2014.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introducere in Algoritmi,Computer Libris Agora, Cluj-Napoca, 1999.
3. L. Livovschi, H. Georgescu, Analiza si sinteza algoritmilor, Ed. Stiintifica si Enciclopedica, Bucumaterialeti, 1986.
4. I. Tomescu, Combinatorica si teoria grafurilor, Tipografia Universitatii din Bucumaterialeti, 1978.
5. C. Croitoru, Tehnici de baza in optimizarea combinatorie, Editura Univ. Al. I. Cuza Iasi, Iasi, 1992.
6. J.-C. Fournier, Graph Theory and Applications, Wiley-Blackwell, 2009.
7. D. Jungnickel, Graphs, Networks and Algorithms, Algorithms and Computation in Mathematics, 3rd Edition, Springer, 2008.
8. R. Diestel, Graph Theory, 5th Edition, Springer, 2016.
9. D. Guichard, An Introduction to Combinatorics and Graph Theory.
10. J. Bang-Jensen, G. Gutin, Digraphs: Theory, Algorithms and ApplicationsSpringer, 2007.

Material didactic:

1. How to think in graphs: An illustrative introduction to Graph Theory and its applications
2. Graphs in Computer Science.

Coding style:

1. Linux kernel coding style
2. Coding style.
3. Good coding style.

Makefile:

1. What is a Makefile and how does it work?
2. Using "make" and writing Makefiles.
3. Make and Makefiles Overview.

Compilare:

1. The Four Stages of Compiling a C Program;
2. A detail story of a process;
3. Different phases of compiling and running a C program.

Pachete software:

1. Leda;
2. The Boost Graph Library;
3. JGraphT;

Alte cursuri:

1. Teoria Grafurilor si Combinatorica
2. Algoritmica grafurilor
3. Graph Algorithms, University of California at Irvine
4. Graph Algorithms, Slovak University of Technology in Bratislava