x/data-structure-typed
1
0
Fork 0
mirror of https://github.com/zrwusa/data-structure-typed.git synced 2025-04-19 06:53:35 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
data-structure-typed/src/interfaces/abstract-graph.ts

32 lines
895 B
TypeScript
Raw Normal View History

[core] renamed id to key
2023-10-10 19:55:52 +08:00
import {VertexKey} from '../types';
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
Organized all the interfaces. Implemented the removeEdgeSrcToDest method for the Graph class.
2023-08-23 23:03:19 +08:00
export interface IAbstractGraph<V, E> {
[core] renamed id to key
2023-10-10 19:55:52 +08:00
hasVertex(vertexOrKey: V | VertexKey): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
addVertex(key: VertexKey, val?: V): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
removeVertex(vertexOrKey: V | VertexKey): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
removeAllVertices(vertices: V[] | VertexKey[]): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
degreeOf(vertexOrKey: V | VertexKey): number;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
edgesOf(vertexOrKey: V | VertexKey): E[];
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
hasEdge(src: V | VertexKey, dest: V | VertexKey): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
getEdge(srcOrKey: V | VertexKey, destOrKey: V | VertexKey): E | null;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
Establish a unified code editor encoding standard by .editorconfig file.
2023-09-12 11:15:20 +08:00
edgeSet(): E[];
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
addEdge(src: V | VertexKey, dest: V | VertexKey, weight: number, val: E): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
Establish a unified code editor encoding standard by .editorconfig file.
2023-09-12 11:15:20 +08:00
removeEdge(edge: E): E | null;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
setEdgeWeight(srcOrKey: V | VertexKey, destOrKey: V | VertexKey, weight: number): boolean;
By constraining the necessity to implement the _createNode method, we ensure that the node types are correct within the subclass. The current design of the Graph needs further optimization.
2023-08-22 08:58:42 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
getMinPathBetween(v1: V | VertexKey, v2: V | VertexKey, isWeight?: boolean): V[] | null;
edge1.data has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
2023-08-22 13:30:22 +08:00
[core] renamed id to key
2023-10-10 19:55:52 +08:00
getNeighbors(vertexOrKey: V | VertexKey): V[];
Establish a unified code editor encoding standard by .editorconfig file.
2023-09-12 11:15:20 +08:00
}
Reference in a new issue Copy permalink