Implement Mayer's algorithm

[denistakeda]

No description provided.

[evxn]

@denistakeda it's hard to understand what is v. Is it vertex id?

[denistakeda]

Yes, exactly

…

23 июля 2021 г., в 19:25, Evgeniy Malyutin ***@***.***> написал(а):  @evxn commented on this pull request. In src/Graph.ts: > + readonly from: number + readonly to: number + readonly weight: number +} + +export interface EdgeWeightedDigraph { + v(): number + adj(v: number): DirectedEdge[] +} + +export class MayersGraph<T> implements EdgeWeightedDigraph { + constructor(private readonly oldS: T[], private readonly newS: T[]) { + + } + + public v(): number { @denistakeda it's hard to understand what is v. Is it vertex id? — You are receiving this because you were mentioned. Reply to this email directly, view it on GitHub, or unsubscribe.