v.depgraph #

fn new_dep_graph() &DepGraph

fn new_ordered_dependency_map() OrderedDepMap

fn show(graph &DepGraph, path string)

fn (mut o OrderedDepMap) set(name string, deps []string)

fn (mut o OrderedDepMap) add(name string, deps []string)

fn (o &OrderedDepMap) get(name string) []string

fn (mut o OrderedDepMap) delete(name string)

fn (mut o OrderedDepMap) apply_diff(name string, deps []string)

fn (o &OrderedDepMap) size() int

struct DepGraph {
pub mut:
	acyclic bool
	nodes   []DepGraphNode
	values  map[string]i64
}

fn (mut graph DepGraph) add(mod string, deps []string)

fn (mut graph DepGraph) add_with_value(mod string, deps []string, value i64)

fn (graph &DepGraph) resolve() &DepGraph

fn (graph &DepGraph) last_node() DepGraphNode

fn (graph &DepGraph) display() string

fn (graph &DepGraph) display_cycles() string