Repository navigation
Expand file tree
/
Copy pathArrayAdjacencyGraph.cs
More file actions
246 lines (216 loc) · 6.82 KB
/
Copy pathArrayAdjacencyGraph.cs
File metadata and controls
246 lines (216 loc) · 6.82 KB
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
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Diagnostics.Contracts;
using System.Diagnostics;
namespace QuickGraph
{
/// <summary>
/// An immutable directed graph data structure efficient for large sparse
/// graph representation where out-edge need to be enumerated only.
/// </summary>
/// <typeparam name="TVertex">type of the vertices</typeparam>
/// <typeparam name="TEdge">type of the edges</typeparam>
#if !SILVERLIGHT
[Serializable]
#endif
[DebuggerDisplay("VertexCount = {VertexCount}, EdgeCount = {EdgeCount}")]
public sealed class ArrayAdjacencyGraph<TVertex, TEdge>
: IVertexAndEdgeListGraph<TVertex, TEdge>
#if !SILVERLIGHT
, ICloneable
#endif
where TEdge : IEdge<TVertex>
{
readonly Dictionary<TVertex, TEdge[]> vertexOutEdges;
readonly int edgeCount;
public ArrayAdjacencyGraph(
IVertexAndEdgeListGraph<TVertex, TEdge> visitedGraph
)
{
Contract.Requires(visitedGraph != null);
this.vertexOutEdges = new Dictionary<TVertex, TEdge[]>(visitedGraph.VertexCount);
this.edgeCount = visitedGraph.EdgeCount;
foreach (var vertex in visitedGraph.Vertices)
{
var outEdges = new List<TEdge>(visitedGraph.OutEdges(vertex));
this.vertexOutEdges.Add(vertex, outEdges.ToArray());
}
}
private ArrayAdjacencyGraph(
Dictionary<TVertex, TEdge[]> vertexOutEdges,
int edgeCount
)
{
Contract.Requires(vertexOutEdges != null);
Contract.Requires(edgeCount >= 0);
Contract.Requires(edgeCount == Enumerable.Sum(vertexOutEdges, kv => (kv.Value == null) ? 0 : kv.Value.Length));
this.vertexOutEdges = vertexOutEdges;
this.edgeCount = edgeCount;
}
#region IIncidenceGraph<TVertex,TEdge> Members
public bool ContainsEdge(TVertex source, TVertex target)
{
TEdge edge;
return this.TryGetEdge(source, target, out edge);
}
public bool TryGetEdges(TVertex source, TVertex target, out IEnumerable<TEdge> edges)
{
TEdge[] es;
if (this.vertexOutEdges.TryGetValue(source, out es))
{
List<TEdge> _edges = null;
for (int i = 0; i < es.Length; i++)
{
if (es[i].Target.Equals(target))
{
if (_edges == null)
_edges = new List<TEdge>(es.Length - i);
_edges.Add(es[i]);
}
}
edges = _edges;
return edges != null;
}
edges = null;
return false;
}
public bool TryGetEdge(TVertex source, TVertex target, out TEdge edge)
{
TEdge[] edges;
if (this.vertexOutEdges.TryGetValue(source, out edges) &&
edges != null)
{
for (int i = 0; i < edges.Length; i++)
{
if (edges[i].Target.Equals(target))
{
edge = edges[i];
return true;
}
}
}
edge = default(TEdge);
return false;
}
#endregion
#region IImplicitGraph<TVertex,TEdge> Members
public bool IsOutEdgesEmpty(TVertex v)
{
return this.OutDegree(v) == 0;
}
public int OutDegree(TVertex v)
{
TEdge[] edges;
if (this.vertexOutEdges.TryGetValue(v, out edges) &&
edges != null)
return edges.Length;
return 0;
}
public IEnumerable<TEdge> OutEdges(TVertex v)
{
TEdge[] edges;
if (this.vertexOutEdges.TryGetValue(v, out edges) &&
edges != null)
return edges;
return Enumerable.Empty<TEdge>();
}
public bool TryGetOutEdges(TVertex v, out IEnumerable<TEdge> edges)
{
TEdge[] aedges;
if (this.vertexOutEdges.TryGetValue(v, out aedges) &&
aedges != null)
{
edges = aedges;
return true;
}
edges = null;
return false;
}
public TEdge OutEdge(TVertex v, int index)
{
return this.vertexOutEdges[v][index];
}
#endregion
#region IGraph<TVertex,TEdge> Members
public bool IsDirected
{
get { return true; }
}
public bool AllowParallelEdges
{
get { return true; }
}
#endregion
#region IImplicitVertexSet<TVertex> Members
public bool ContainsVertex(TVertex vertex)
{
return this.vertexOutEdges.ContainsKey(vertex);
}
#endregion
#region IVertexSet<TVertex> Members
public bool IsVerticesEmpty
{
get { return this.vertexOutEdges.Count == 0; }
}
public int VertexCount
{
get { return this.vertexOutEdges.Count; }
}
public IEnumerable<TVertex> Vertices
{
get
{
return this.vertexOutEdges.Keys;
}
}
#endregion
#region IEdgeSet<TVertex,TEdge> Members
public bool IsEdgesEmpty
{
get { return this.edgeCount == 0; }
}
public int EdgeCount
{
get { return this.edgeCount; }
}
public IEnumerable<TEdge> Edges
{
get
{
foreach(var edges in this.vertexOutEdges.Values)
if (edges != null)
for (int i = 0; i < edges.Length; i++)
yield return edges[i];
}
}
public bool ContainsEdge(TEdge edge)
{
TEdge[] edges;
if (this.vertexOutEdges.TryGetValue(edge.Source, out edges) &&
edges != null)
for (int i = 0; i < edges.Length; i++)
if (edges[i].Equals(edge))
return true;
return false;
}
#endregion
#region ICloneable Members
/// <summary>
/// Returns self since this class is immutable
/// </summary>
/// <returns></returns>
public ArrayAdjacencyGraph<TVertex, TEdge> Clone()
{
return this;
}
#if !SILVERLIGHT
object ICloneable.Clone()
{
return this.Clone();
}
#endif
#endregion
}
}