1.1.0: graphs & priority queues and refactors

Documentation: https://lerax.me/data-structures/

What's Changed

• fix: ensure all nodes are visited in bfs/dfs with directed graphs by @ryukinix in #51
• feat: add method to check if graph is acyclical by @ryukinix in #52
• feat: add tarjan edge classification by @ryukinix in #53
• fix: always use -fPIC to avoid need of recompilation by @ryukinix in #54
• feat: add topological sort algorithm by @ryukinix in #55
• fix: ufc notes broken links by @ryukinix in #56
• feat: priority queue of max/min generalized by @ryukinix in #57
• feat: priority queue with key and value by @ryukinix in #58
• feat: add dijkstra by @ryukinix in #59
• feat(ci): add lint target with cppcheck by @ryukinix in #60
• feat: make compatible with g++ and clang++ by @ryukinix in #61
• feat(graph): add kruskal and strong components detection by @ryukinix in #62
• feat: add graph_prim by @ryukinix in #63

Full Changelog: 1.0.0...1.1.0

1.0.0: the big bang refactor and revival

Introduced new data structures:

• avl
• hash table
• set
• graph
• generic iterator
• generic list

Renamed lib to ds-lerax, rewrite entire documentation, ci/cd, automatic doc update, new README.md and such others

What's Changed

• Move notas de estudo para /docs by @ryukinix in #2
• Add toplevel-header and update LICENSE by @ryukinix in #3
• Add toplevel Makefile and generate lib/ds-ufc.h by @ryukinix in #4
• Add implicit headers non-preprocessed to generated lib by @ryukinix in #5
• Add doxygen documentation by @ryukinix in #13
• Move some modules to examples/ by @ryukinix in #16
• Fix print for: stack, queue and pqueue by @ryukinix in #17
• Add make install and make test by @ryukinix in #18
• Fix docs links by @ryukinix in #19
• Expose data structures to header by @ryukinix in #20
• feat: add ci config to run make check and make docs by @ryukinix in #22
• docs: create docs/mainpage.dox by @ryukinix in #23
• fix(ci-docs): make docker-docs -> make docs by @ryukinix in #24
• fix(docs-ci): fix of the fix the master of all fixes by @ryukinix in #25
• refactor: remove ufc references and rename ds-ufc to ds-lerax by @ryukinix in #26
• feat: add AVL by @ryukinix in #27
• feat: add radixsort by @ryukinix in #28
• perf: improve mergesort performance by @ryukinix in #29
• debug: add easier way to debug quicksort by @ryukinix in #30
• feat: add selectionsort by @ryukinix in #31
• feat: add search module by @ryukinix in #32
• feat(search): add search_kr algorithm by @ryukinix in #33
• fix: remove useles DS_UFC_H definition #21 by @ryukinix in #34
• fix: solve several issues about headers and lib distribution by @ryukinix in #35
• chore: bump copyright to 2017-2025 by @ryukinix in #36
• fix: make clean now remove all intermediary files by @ryukinix in #37
• feat: add hash-table by @ryukinix in #38
• feat: add set data structure by @ryukinix in #39
• tests: add make check-valgrind by @ryukinix in #40
• docs: big bang refactor by @ryukinix in #41
• docs: fix aesthetics details by @ryukinix in #42
• feat: add graph by @ryukinix in #43
• feat: add bfs and generic iterator by @ryukinix in #44
• refactor: simplify iterator interface by @ryukinix in #46
• feat: add graph_dfs iterator by @ryukinix in #47
• feat: add undirected graph constructor by @ryukinix in #48
• feat: graph weighted by @ryukinix in #49
• docs: rewrite README.md and archive old ufc notes by @ryukinix in #50

New Contributors

Full Changelog: 0.3.0...1.0.0

Versão compilada em PDF 0.3.0 & lib

Último trabalho de Estrutura de Dados
Essa versão contém a adição de:

• Algoritmos de Ordenação
• Filas de Prioridade usando Heap
• Melhorias e modificação nas estruturas de Árvore
• Um relatório de análise sobre algoritmos de ordenação

EDIT: em 2019 estou lançando agora, dia 13/03/2019, a reorganização dessa estrutura como uma biblioteca C!

Versão compilada em PDF 0.2.0

Adiciona mais notas compiladas cobrindo os seguintes assuntos:

• pilha e fila
• árvores
• árvore binária de busca
• árvore AVL
• árvore RB

Versão compilada em PDF 0.1.0

Atualmente possuí notas sobre:

• Funções, Ponteiros, Vetores e Matrizes 0-funcoes-ponteiros-vetores-matrizes.pdf
• Tipos Estruturados
• Tipos Abstratos de Dados
• Complexidade
• Listas Encadeadas

Durante a disciplina irei escrever mais notas e melhorar essas já feitas.