data-structures

Graph

Class

class Graph {
  edges: Map<string, E>;  directed: boolean;  sort(compareFn?: (edgeA: E, edgeB: E) => number): any;  addEdge(...e: E[]): E[];  addVertex(...v: V[]): V[];  deleteVertex(...v: V[]): V[];  getVertex(v: string | V): V;  getEdge(...args: [u: string | V, v: string | V] | [e: string | E]): E;  deleteEdge(...e: E[]): E[];  getEdgeNeighbors(v: string | V): E[];  [Symbol.iterator](): IterableIterator<E>;  static create(edges: { [key: string]: string[]; }): Graph<Vertex, Edge<Vertex>>;}

Members

edges

Map<string, E>

directed

boolean

sort

any

@paramcompareFn(edgeA: E, edgeB: E) => number

@returnsany

addEdge

E[]

@parameE[]

@returnsE[]

addVertex

V[]

@paramvV[]

@returnsV[]

deleteVertex

V[]

@paramvV[]

@returnsV[]

getVertex

V

@paramvstring | V

@returnsV

getEdge

E

@paramargs[u: string | V, v: string | V] | [e: string | E]

@returnsE

deleteEdge

E[]

@parameE[]

@returnsE[]

getEdgeNeighbors

E[]

@paramvstring | V

@returnsE[]

[Symbol.iterator]

IterableIterator<E>

@returnsIterableIterator<E>

create

Graph<Vertex, Edge<Vertex>>

@complexityO(n)

@paramedges{ [key: string]: string[]; }

@returnsGraph<Vertex, Edge<Vertex>>