# @copyright 1996, The Regents of the University of California
DEP=graphtool.h 
LNK=-L. -lgraphtool -lm 
CC=gcc

all: bipartite bipmatch chull \
     clayers delete_thin_edges dt edge_length \
     exedge faceweights flipdt geom_mst hamcycle2 \
     random shortestcycle shortestnfcycle \
     shortestpath strip1 sweeptri vor weightsums
	echo "Completed"

bipartite: bipartite.c $(DEP)
	$(CC) -o  bipartite bipartite.c $(LNK)

bipmatch: bipmatch.c $(DEP)
	$(CC) -o  bipmatch bipmatch.c $(LNK)

chull: chull.c $(DEP)
	$(CC) -o  chull chull.c $(LNK)

clayers: clayers.c $(DEP)
	$(CC) -o  clayers clayers.c $(LNK)

delete_thin_edges: delete_thin_edges.c $(DEP)
	$(CC) -o  delete_thin_edges delete_thin_edges.c $(LNK)

dt: dt.c $(DEP)
	$(CC) -o  dt dt.c $(LNK)

edge_length: edge_length.c $(DEP)
	$(CC) -o  edge_length edge_length.c $(LNK)

exedge: exedge.c $(DEP)
	$(CC) -o  exedge exedge.c $(LNK)

faceweights: faceweights.c $(DEP)
	$(CC) -o  faceweights faceweights.c $(LNK)

flipdt: flipdt.c $(DEP)
	$(CC) -o  flipdt flipdt.c $(LNK)

geom_mst: geom_mst.c $(DEP)
	$(CC) -o  geom_mst geom_mst.c $(LNK)

hamcycle2: hamcycle2.c $(DEP)
	$(CC) -o  hamcycle2 hamcycle2.c $(LNK)

random: random.c $(DEP)
	$(CC) -o  random random.c $(LNK)

shortestcycle: shortestcycle.c $(DEP)
	$(CC) -o  shortestcycle shortestcycle.c $(LNK)

shortestnfcycle: shortestnfcycle.c $(DEP)
	$(CC) -o  shortestnfcycle shortestnfcycle.c $(LNK)

shortestpath: shortestpath.c $(DEP)
	$(CC) -o  shortestpath shortestpath.c $(LNK)

strip1: strip1.c $(DEP)
	$(CC) -o  strip1 strip1.c $(LNK)

sweeptri: sweeptri.c $(DEP)
	$(CC) -o  sweeptri sweeptri.c $(LNK)

vor: vor.c $(DEP)
	$(CC) -o  vor vor.c $(LNK)

weightsums: weightsums.c $(DEP)
	$(CC) -o  weightsums weightsums.c $(LNK)
