const std = @import("std");
const graph = @import("graph");
pub fn main() void {
	// Create a directed graph type for strings.
	const Graph = graph.DirectedGraph([]const u8, std.hash_map.StringContext);
	// Initialize using some allocator
	var g = Graph.init(std.debug.global_allocator);
	defer g.deinit();
	// Add some vertices
	try g.add("A");
	try g.add("B");
	try g.add("C");
	// Add some edges with weights. For unweighted edges just make all
	// weights the same value.
	try g.addEdge("A", "B", 5);
	try g.addEdge("A", "C", 2);
	try g.addEdge("B", "C", 2);
	try g.addEdge("C", "B", 3);
	// We can detect cycles
	if (g.cycles()) |cycles| {
		defer cycles.deinit();
		std.log.info("there are {d} cycles", .{cycles.count()});
		return;
	}
	// We can do a depth-first search through iteration.
	var dfsIter = try g.dfsIterator("B");
	while (dfsIter.next()) |id| {
		std.log.info("{}", .{g.lookup(id).?});
	}
	dfsIter.deinit();
	// We can easily reverse the graph if we want.
	const reversed = g.reverse();
	// ... and more
}