MCPcopy
hub / github.com/arnauddri/algorithms / NewDirected

Function NewDirected

data-structures/graph/directed_graph.go:7–15  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

5}
6
7func NewDirected() *DirGraph {
8 return &DirGraph{
9 graph{
10 edgesCount: 0,
11 edges: make(map[VertexId]map[VertexId]int),
12 isDirected: true,
13 },
14 }
15}
16
17func (g *graph) GetPredecessors(vertex VertexId) VerticesIterable {
18 iterator := func() <-chan VertexId {

Callers 2

ReverseMethod · 0.85
TestDirectedGraphFunction · 0.85

Calls

no outgoing calls

Tested by 1

TestDirectedGraphFunction · 0.68