MCPcopy Create free account
hub / github.com/arnauddri/algorithms / GetEdge

Method GetEdge

data-structures/graph/graph.go:175–177  ·  view source on GitHub ↗
(from, to VertexId)

Source from the content-addressed store, hash-verified

173}
174
175func (g *graph) GetEdge(from, to VertexId) int {
176 return g.edges[from][to]
177}
178
179func (g *graph) GetNeighbours(vertex VertexId) VerticesIterable {
180 iterator := func() <-chan VertexId {

Callers 1

ShortestPathFunction · 0.80

Calls

no outgoing calls

Tested by

no test coverage detected