Scholarlink

<p>In the paper, we introduce 2-outgoing graphs that generalize functional graphs and are used for modeling discrete dynamic systems of a special type. The vertices and arcs of a 2-outgoing graph are classified, paths on these graphs are defined, and some properties of these paths are proved. As a result, an efficient algorithm is constructed that, with linear complexity, constructs final vertices for paths starting at each of the vertices of a 2-outgoing graph, and its validity is established.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Efficient Algorithm for Finding Final Vertices in a Generalized Functional Graph

  • 期刊论文

  • 发表日期：

    2025年6月1日

查看全文
  • O. V. Zubkov

摘要

In the paper, we introduce 2-outgoing graphs that generalize functional graphs and are used for modeling discrete dynamic systems of a special type. The vertices and arcs of a 2-outgoing graph are classified, paths on these graphs are defined, and some properties of these paths are proved. As a result, an efficient algorithm is constructed that, with linear complexity, constructs final vertices for paths starting at each of the vertices of a 2-outgoing graph, and its validity is established.