doctest help

Description of Change

1. adding new feature - articulation point algorithm. In a graph, a vertex is called an articulation point if removing it and all the edges associated with it results in the increase of the number of connected components in the graph. For example consider the graph given in following figure.
2. moving the GraphRep struct from Graph.c to Graph.h

References

<!

Add a PR with any competitive coding problem
In

• /Practice Problems/ add competitive coding problems and solutions in the respective topic folder

Check other folders in Arrays how it is done in rest of file

E.g

• Add a folder in Arrays folder with the *N

Dado um número de CPF, o algoritmo deve validar se o número dado é um número válido.
Detalhes de como o cálculo funciona pode ser encontrado aqui

Descrição da Função
A função deve ser capaz de receber o CPF como Integer ou String.

Se for String, deve retirar pontos para manter somente os números.

Em seguida, deve fazer os cálculos da validação

The project_euler_problems folder currently has only a very few problems. It would be nice if more interesting questions and their solutions be added from Project Euler

Refer Contribting.md and read all points carefully before sending a Pull request.

Keep this in mind: When adding solu