1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
using System.Data;
using System.Drawing;
using System.Text;
 
namespace Yw.EPAnet
{
    /// <summary>
    /// 管网路径分析拓展
    /// </summary>
    public static class NetworkPathAnalyseExtensions
    {
 
        
        public static List<ChartNode> GetChartNodeByPathLinks(this Network network, List<ILink> links)
        {
            
 
          
            double length = 0;
            ChartNode nodeEnd = new ChartNode();
            List<ChartNode> chartNodes = new List<ChartNode>();
            for (int i = 0; i < links.Count; i++)
            {
 
                var link = links[i];
 
                var node = link.Flow > 0 ? link.StartNode : link.EndNode;
 
 
                var Cnode = new ChartNode()
                {
                    Id = node.Id,
                    StartHead = node.Head,
 
                    EndHead = node.Head,
 
                    Elev = node.Elev
                };
                chartNodes.Add(Cnode);
            
 
                var nodeEnd0 = link.Flow > 0 ? link.EndNode : link.StartNode;
                nodeEnd.Id = nodeEnd0.Id;
                nodeEnd.Head = nodeEnd.StartHead = nodeEnd.EndHead = nodeEnd0.Head;
                nodeEnd.Elev = nodeEnd0.Elev;
 
                if (link is Pipe p)
                    length += p.Length;
            }
 
            chartNodes.Add(nodeEnd);
 
            for (int i=0;i<links.Count;i++)
            {
 
                var link = links[i];
                
                Pipe p=link as Pipe;
 
                if (p != null)
                {
                    //根据p.diameter和p.flow计算流速
                    double velocity = p.Flow / (Math.PI * Math.Pow(p.Diameter / 2, 2));
                    //根据流速计算局部水头损失
                    double minorloss1 = p.StartNodeMinorlossCoff* Math.Pow(velocity, 2) / 2 / 9.81;
                    double minorloss2 = p.EndNodeMinorlossCoff * Math.Pow(velocity, 2) / 2 / 9.81;
 
 
                    if (i < links.Count - 1)
                    {
 
                        chartNodes[i].EndHead = chartNodes[i].Head - minorloss1;
 
                        chartNodes[i + 1].StartHead = chartNodes[i].EndHead - minorloss2;
 
                        
                    }
                    else
                    {
                        chartNodes[i].EndHead = chartNodes[i].Head - minorloss1;
                    }
                    
                }
                
                
            }
            return chartNodes;
 
        }
 
 
        /// <summary>
        /// 分析下游主要供水路径
        /// </summary>
        public static List<ILink> AnalyzeDownstreamPath(this Network network, Junction startJunc)
        {
            var visitedNodes = new HashSet<INode>();
            var maxlink = startJunc.NextLinks.OrderByDescending(o => Math.Abs(o.Flow)).ToList()[0];
            return  network.TraversePipeNetworkALL(maxlink, visitedNodes, 1, true);
        }
        
        /// <summary>
        /// 分析上游主要供水路径
        /// </summary>
        /// <param name="network"></param>
        /// <param name="startJunc"></param>
        /// <returns></returns>
        public static List<ILink> AnalyzeUpstreamPath(this Network network, Junction startJunc)
        {
            var visitedNodes = new HashSet<INode>();
            var maxlink = startJunc.NextLinks.OrderByDescending(o => Math.Abs(o.Flow)).ToList()[0];
            return network.TraversePipeNetworkALL(maxlink, visitedNodes, -1, true);
        }
        /// <summary>
        /// 宽度搜索遍历管网
        /// </summary>
        /// <param name="network"></param>
        /// <param name="startLink">起始管线</param>
        /// <param name="visitedNodes">遍历的哈希表(用于多点遍历)</param>
        /// <param name="direction">遍历方向,0表示双向,1表示正向,-1表示反向</param>
        /// <param name="isOnlyMax">是否只取最大流量的分支</param>
        /// <returns></returns>
        public static List<ILink> TraversePipeNetworkALL(this Network network,ILink startLink, HashSet<INode> visitedNodes = null, int direction = 0, bool isOnlyMax = false)
        {
            var _links主要路径=new List<ILink>();
            if (isOnlyMax) _links主要路径.Add(startLink);
            Queue<ILink> queue = new Queue<ILink>();
 
            queue.Enqueue(startLink);
            if (visitedNodes == null)
                visitedNodes = new HashSet<INode>();
 
            while (queue.Count > 0)
            {
                ILink currentLink = queue.Dequeue();
                if (isOnlyMax) _links主要路径.Add(currentLink);
 
                foreach (var node in new INode[] { currentLink.StartNode, currentLink.EndNode })
                {
                    if (direction == 1 && currentLink.Flow >= 0 && node == currentLink.StartNode) continue;
                    if (direction == -1 && currentLink.Flow <= 0 && node == currentLink.EndNode) continue;
                    if (node != null && !visitedNodes.Contains(node))
                    {
                        visitedNodes.Add(node);
                        List<ILink> list = new List<ILink>();
 
                        foreach (var link in node.Links)
                        {
                            if (!visitedNodes.Contains(link.StartNode) || !visitedNodes.Contains(link.EndNode))
                            {
                                list.Add(link);
 
                            }
                        }
                        if (!isOnlyMax)
                        {
                            foreach (var link in list)
                            {
 
                                queue.Enqueue(link);
                            }
                        }
                        else
                        {
                            if (list.Count >= 1)
                            {
                                var maxlist = list.OrderByDescending(p => Math.Abs(p.Flow)).ToList()[0];
                                queue.Enqueue(maxlist);
                            }
 
                        }
                    }
                }
 
            }
            return _links主要路径;
 
 
        }
 
    }
 
    public class ChartNode
    {
        public string Id { get; set; }
 
        /// <summary>
        /// 起始水头
        /// </summary>
        public double StartHead { get; set; }
 
        /// <summary>
        /// 结束水头
        /// </summary>
        public double EndHead { get; set; }
 
        /// <summary>
        /// 高程
        /// </summary>
        public double Elev { get; set; }
 
        /// <summary>
        /// 水头
        /// </summary>
        public double Head { get; internal set; }
 
        /// <summary>
        /// 局部水头损失
        /// </summary>
        public double MinorHeadLoss 
        {
            get 
            {
                return StartHead - EndHead;
            }
        }
    }
}