Proyecto para encontrar 2 puntos más cercano para el curso de Análisis y Diseño de Algoritmos.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

36 lines
591B

  1. CC=gcc
  2. CFLAGS=-Wall -Isrc/include -DDEBUG -g
  3. LDFLAGS=-lm
  4. SRC=src/points.c src/timer.c src/random.c
  5. OBJ=$(SRC:.c=.o)
  6. all: points informe
  7. points: $(OBJ)
  8. $(CC) -o $@ $^ $(LDFLAGS)
  9. informe:
  10. # if pdflatex is installed create the informe
  11. ifneq (, $(shell which pdflatex))
  12. make -C doc
  13. mv doc/Informe.pdf Informe.pdf
  14. endif
  15. test:
  16. make -C test
  17. test/test
  18. clean: cleanpoints cleaninforme cleantest
  19. cleanpoints:
  20. rm -f src/*.o points
  21. cleaninforme:
  22. make -C doc clean
  23. rm -f Informe.pdf
  24. cleantest:
  25. make -C test clean
  26. .PHONY: all points informe test clean cleanpoints cleaninforme cleantest