The Method of Automatic Formation of Defining Nodes for Calculations of Flow Distribution in Hydraulic Networks

Hydraulic networks are considered, which are characterized by a significant influence of pressure (potential) losses on nodal elements that are tees or are represented by them so that the degree of nodes of the design graph does not exceed 3. The RV algorithm is proposed for the automatic formation of a set of defining nodes, each of which, when broken, ensures the break of two cycles of the system of fundamental cycles of the graph, built on the basis of the system of chords obtained by the method of searching in width when constructing the spanning tree. The RV algorithm proposed for selecting the defining nodes does not break the graph’s connectivity. And in cases where cycles remain after the breaks of the defining nodes, such cycles will be isolated.

Authors

Publication Details

Journal
Èlektronnoe modelirovanie
Published
2025-04-07
DOI
https://doi.org/10.15407/emodel.47.02.003
Primary Topic
Geotechnical and Geomechanical Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Method of Automatic Formation of Defining Nodes for Calculations of Flow Distribution in Hydraulic Networks

S.D. Vynnychuk
Èlektronnoe modelirovanie
Geotechnical and Geomechanical Engineering
article

The Method of Automatic Formation of Defining Nodes for Calculations of Flow Distribution in Hydraulic Networks

S.D. Vynnychuk
article en

Abstract

Hydraulic networks are considered, which are characterized by a significant influence of pressure (potential) losses on nodal elements that are tees or are represented by them so that the degree of nodes of the design graph does not exceed 3. The RV algorithm is proposed for the automatic formation of a set of defining nodes, each of which, when broken, ensures the break of two cycles of the system of fundamental cycles of the graph, built on the basis of the system of chords obtained by the method of searching in width when constructing the spanning tree. The RV algorithm proposed for selecting the defining nodes does not break the graph’s connectivity. And in cases where cycles remain after the breaks of the defining nodes, such cycles will be isolated.

Èlektronnoe modelirovanieVol. 47(2)
Openalex Percentile: Top 91%
Geotechnical and Geomechanical Engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.