Skip to content

Commit 50118ec

Browse files
author
Кур'янов Артем
committed
made _edges public, renamed to Edges by convention
1 parent 6b11059 commit 50118ec

File tree

1 file changed

+8
-8
lines changed

1 file changed

+8
-8
lines changed

src/Dijkstra.NET/Graph/Node.cs

Lines changed: 8 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -7,15 +7,15 @@ namespace Dijkstra.NET.Graph
77
{
88
public class Node<T, TEdgeCustom>: IPageRank, IDijkstra, INode<T, TEdgeCustom> where TEdgeCustom: IEquatable<TEdgeCustom>
99
{
10+
public Edge<T, TEdgeCustom>[] Edges;
1011
private readonly HashSet<Node<T,TEdgeCustom>> _parents = new HashSet<Node<T, TEdgeCustom>>();
1112
private readonly HashSet<uint> _children = new HashSet<uint>();
12-
private Edge<T, TEdgeCustom>[] _edges;
1313

1414
internal Node(uint key, T item, Graph<T, TEdgeCustom> graph)
1515
{
1616
Key = key;
1717
Item = item;
18-
_edges = new Edge<T, TEdgeCustom>[5];
18+
Edges = new Edge<T, TEdgeCustom>[5];
1919
Graph = graph;
2020
}
2121

@@ -46,7 +46,7 @@ public void EachEdge(Edge edge)
4646
{
4747
for (int i = 0; i < EdgesCount; i++)
4848
{
49-
ref Edge<T, TEdgeCustom> e = ref _edges[i];
49+
ref Edge<T, TEdgeCustom> e = ref Edges[i];
5050

5151
edge(e.Node.Key, e.Cost);
5252
}
@@ -58,15 +58,15 @@ public void EachEdge(Edge edge)
5858
/// <returns>TEdgeCustom</returns>
5959
public TEdgeCustom GetFirstEdgeCustom(int nodeEdgeKey)
6060
{
61-
return _edges.First(c => c.Node.Key == nodeEdgeKey).Item;
61+
return Edges.First(c => c.Node.Key == nodeEdgeKey).Item;
6262
}
6363

6464

6565
internal void AddEdge(in Edge<T, TEdgeCustom> edge)
6666
{
67-
if (_edges.Length == EdgesCount)
67+
if (Edges.Length == EdgesCount)
6868
{
69-
int newSize = _edges.Length;
69+
int newSize = Edges.Length;
7070

7171
if (EdgesCount < NodeConstants.MaxSize)
7272
{
@@ -79,10 +79,10 @@ internal void AddEdge(in Edge<T, TEdgeCustom> edge)
7979
newSize = bigSize < Int32.MaxValue ? (int)bigSize : Int32.MaxValue;
8080
}
8181

82-
Array.Resize(ref _edges, newSize);
82+
Array.Resize(ref Edges, newSize);
8383
}
8484

85-
_edges[EdgesCount] = edge;
85+
Edges[EdgesCount] = edge;
8686
EdgesCount++;
8787
_children.Add(edge.Node.Key);
8888
}

0 commit comments

Comments
 (0)