graph

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

type EliminateOpt struct {
	Graph          Graph
	In             func(Node) bool // Should node be included
	KeepMultiEdges bool
}

type Graph interface {
	NumNodes() int
	Node(int) Node
	NumOuts(Node) int
	Out(Node, int) Node
}

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

type Labeler func(interface{}) string

type LessThan func(Node, Node) bool

type MakeQuotientOpt struct {
	Graph         Graph
	Colorer       func(Node) interface{}
	HasColor      func(Node) bool
	Present       func(Node) bool // Should n be included at all
	KeepSelfEdges bool
}

type Node interface{}

type NodeSet interface {
	Has(Node) bool
	Values() []Node
	Len() int
}

type PartitionTreeOpt struct {
	Tree       Graph
	Root       Node
	Colors     func(n Node) []int   // Possible colors n may take; all nodes in graph must have at least one color
	EdgeWeight func(a, b int) int64 // Weight between a and b (non-negative); depth(a) < depth(b)
	NodeWeight func(a int) int      // Weight of a
	// contains filtered or unexported fields
}

type PrintOpt struct {
	Graph        Graph
	NodeLabelers []Labeler
}

type QGraph interface {
	Graph
	OrigGraph() Graph    // Original graph that this graph was constructed from
	NumOrigs(Node) int   // Number of nodes in the original graph that this node represents
	Orig(Node, int) Node // The ith node in the original graph that this node represents
}

type Reachability map[Node]map[Node]bool

type SDag struct {
	Graph Graph
	Roots []Node
	Ins   map[Node]int
}

type ShortestPathOpt struct {
	Graph   Graph
	Sources []Node
	Weight  func(x, y Node) int64
}

type SimplifyOpt struct {
	Graph            Graph
	RemoveSelfLoops  bool
	RemoveMultiEdges bool
	RemoveNodes      func(Node) bool // Should node be removed
}

type StringGraph struct {
	Nodes []string
	Outs  map[string][]string
}

type TopoSortOpt struct {
	Graph     Graph
	NodeOrder LessThan // Optional argument to ensure deterministic output
}

type TreePartition struct {
	Parts  map[Node]int
	Weight int64
}

type TreeVisitor func(n, parent Node, err error) error

type VisitOpt struct {
	Root         Node    // Root of traversal
	Graph        Graph   // Graph to traverse
	Visitor      Visitor // Function to apply when node first encountered
	Seen         Visitor // Function applied on subsequent visits to a node
	BreadthFirst bool    // Visit nodes breadth first
}

type VisitResult struct {
	Seen      NodeSet
	Frontiers []NodeSet // If VisitOpt.BreadthFirst, successive frontiers are placed here
}

type VisitTreeOpt struct {
	Tree      Graph
	Root      Node
	PreOrder  TreeVisitor // if err != TraversalDone, propagate error
	PostOrder TreeVisitor // if err != TraversalDone, propagate error
}

type Visitor func(Node) error