2023
DOI: 10.1016/j.actaastro.2022.11.009
|View full text |Cite
|
Sign up to set email alerts
|

Driving cable design for a cylindrical deployable mechanism based on depth first search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(1 citation statement)
references
References 25 publications
0
0
0
Order By: Relevance
“…After completing the construction of the passenger travelling path selection model, this paper uses the DFS algorithm as the base algorithm because Depth First Search (DFS) is a search algorithm that works on the principle that when all adjacent edges where a node ๐‘ is located have been searched, it will backtrack to the starting node where the edge where the node ๐‘ is located is found, up to all nodes reachable by the source node. If there are still undiscovered nodes, one of them is selected as the source node and the search is repeated until all nodes are traversed [6,7]. In this paper, based on DFS algorithm and Dijkstra's algorithm [8,9], we propose a path search algorithm to improve DFS with the following steps:…”
Section: Algorithms and Processesmentioning
confidence: 99%
“…After completing the construction of the passenger travelling path selection model, this paper uses the DFS algorithm as the base algorithm because Depth First Search (DFS) is a search algorithm that works on the principle that when all adjacent edges where a node ๐‘ is located have been searched, it will backtrack to the starting node where the edge where the node ๐‘ is located is found, up to all nodes reachable by the source node. If there are still undiscovered nodes, one of them is selected as the source node and the search is repeated until all nodes are traversed [6,7]. In this paper, based on DFS algorithm and Dijkstra's algorithm [8,9], we propose a path search algorithm to improve DFS with the following steps:…”
Section: Algorithms and Processesmentioning
confidence: 99%