LdDl / ch

Contraction Hierarchies (with bidirectional version of Dijkstra's algorithm) technique for computing shortest path in graph.
Apache License 2.0
46 stars 5 forks source link

[FEATURE REQUEST] Getter/setter for attribute 'importance' #11

Closed LdDl closed 3 years ago

LdDl commented 3 years ago

Is your feature request related to a problem? Please describe. Currently field

type Vertex struct {
    ...
    importance    int
        ...
}

is unexported. For extended debugging in external appliactions and import/export function we need to make getter/setter for it.

Describe the solution you'd like and provide pseudocode examples if you can Pretty simple getter/setter combo:

func (vertex *Vertex) Importance() int {
    return vertex.importance
}
func (vertex *Vertex) SetImportance(importance int){
    vertex.importance = importance
}

Describe alternatives you've considered and provide pseudocode examples if you can Nope

Additional context Nope