UNPKG

traffic-traversal

Version:

Calculate the weights between each vertex node and help you find the fastest route.

github.com/izure1/traffic-traversal

izure1/traffic-traversal

8 lines (7 loc) • 440 B
1
2
3
4
5
6
7
8
export declare function remove<T>(array: T[], ...items: T[]): void; export declare function add<T>(array: T[], ...items: T[]): void; export declare function ensure<T>(array: T[], ...items: T[]): void; export declare function has<T>(array: T[], ...items: T[]): boolean; export declare function first<T>(array: T[]): T | undefined; export declare function last<T>(array: T[]): T | undefined; export declare function copy<T>(array: T[]): T[];