Producing adjacency matrix for random connected graphs with at least one negative cost cycle

How can I produce adjacency matrix for random connected graphs with at least one negative cost cycle? Such graphs are useful for testing the algorithms that find negative cost girth in a graph. Thanks