path

type CC interface {
	// Connected tells whether vertices v and w are connected
	Connected(v, w int) bool
	// Count is the number of components in the graph
	Count() int
	// ID of the component containing vertex v
	ID(v int) int
}

type DFO struct {
	// Pre is a slice of the vertices in preorder.
	Pre []int
	// Post is a slice of the vertices in postorder.
	Post []int
	// ReversePost is a slive of the vertices in reverse postorder.
	ReversePost []int
}

type PathFinder interface {
	// HasPathTo tells whether there is a path between the source and the
	// destination
	HasPathTo(destination int) bool
	// PathTo returns the path from the source to the destination
	PathTo(destination int) []int
}

type SCC interface {
	// Connected tells whether vertices v and w are connected
	StronglyConnected(v, w int) bool
	// Count is the number of components in the digraph
	Count() int
	// ID of the component containing vertex v
	ID(v int) int
}

type TransitiveClosure struct {
	// contains filtered or unexported fields
}