Declare a structure of static matrix-based tree. #2
Labels
No labels
No milestone
No project
No assignees
1 participant
Notifications
Due date
No due date set.
Dependencies
No dependencies set.
Reference
frdl/core#2
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "%!s()"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
T's allocation structure must be static matrix. (You define the capacity)
'T must be read/written as a tree.
Entrance of the tree is guaranteed to be one.
Exit of the three could be plural.
Vector of each tree is guaranteed to be constant.
Each Entrance/Exit must have an identification.
You will need to define api for configuring, iterating the tree.
You will need to define iterator for the tree.
준비가 되지 않은 것으로 판단, 이슈를 닫는다.