本文整理汇总了C#中AdjacencyGraph.TryGetOutEdges方法的典型用法代码示例。如果您正苦于以下问题：C# AdjacencyGraph.TryGetOutEdges方法的具体用法？C# AdjacencyGraph.TryGetOutEdges怎么用？C# AdjacencyGraph.TryGetOutEdges使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类AdjacencyGraph的用法示例。
在下文中一共展示了AdjacencyGraph.TryGetOutEdges方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C#代码示例。
示例1: PerformNotifications
/// <summary>
/// Performs all notifications needed.
/// </summary>
private static void PerformNotifications()
{
var graph = new AdjacencyGraph<string, Edge<string>>();
foreach (string projectFolder in Directory.GetDirectories(Arguments.RootPath))
{
string projectName = Path.GetFileName(projectFolder);
string referencesDirectory = Path.Combine(projectFolder, Arguments.ReferencesFolderName);
graph.AddVerticesAndEdgeRange(
ReferenceMark.GetCurrent(ReferenceType.Internal, referencesDirectory)
.Select(referenceName => new Edge<string>(referenceName, projectName)));
graph.AddVerticesAndEdgeRange(
ReferenceMark.GetCurrent(ReferenceType.External, referencesDirectory)
.Select(referenceName => new Edge<string>(referenceName, projectName)));
}
GraphHelper.RemoveExplicitEdges(graph);
List<string> projectsToNotify = new List<string>();
IEnumerable<Edge<string>> outEdges;
if (graph.TryGetOutEdges(Arguments.ProjectName, out outEdges))
{
projectsToNotify.AddRange(outEdges.Select(edge => edge.Target));
}
string fileName = ReferenceMark.GetReferenceMarkName(Arguments.ProjectName);
foreach (string file in FindReferenceMarks(fileName))
{
string path = Path.GetDirectoryName(file);
path = Path.GetDirectoryName(path);
path = Path.GetDirectoryName(path);
string projectName = Path.GetFileName(path);
Console.WriteLine(
Resources.LogReferencedBy,
projectName);
if (projectsToNotify.Contains(projectName))
{
ReferenceMark.MarkUpdatedFile(file);
Console.WriteLine(
Resources.LogTriggeredBuild,
projectName);
}
}
}示例2: MinimalCutFind
public void MinimalCutFind(AdjacencyGraph<int, Edge<int>> graph)
{
if (graph == null)
throw new ArgumentNullException("graph");
List<int> results = new List<int>();
for (int i = 1; i <= (graph.VertexCount * graph.VertexCount); i++)
{
while (graph.VertexCount > 2)
{
// get the vertext to delete
int x = _random.Next(0, graph.VertexCount);
int vertexToDelete = graph.Vertices.ElementAt(x);
// get the target vertex to merge to
IEnumerable<Edge<int>> e = new List<Edge<int>>();
graph.TryGetOutEdges(vertexToDelete, out e);
int r = _random.Next(0, e.Count());
int vertexToMergeTo = e.ElementAt(r).Target;
// list of edges which need to be merged based on the vertex to delete
IEnumerable<Edge<int>> edgesToMerge = new List<Edge<int>>();
graph.TryGetOutEdges(vertexToDelete, out edgesToMerge);
// temp lists to store the edges to add and remove.
List<Edge<int>> edgesToRemove = new List<Edge<int>>();
List<Edge<int>> edgesToAdd = new List<Edge<int>>();
// for each edge, create a new edge linked to the target vertex. If the target is the same remove.
foreach (Edge<int> edge in edgesToMerge)
{
if (vertexToMergeTo == edge.Target)
{
edgesToRemove.Add(edge);
}
else
{
Edge<int> newEdge = new Edge<int>(vertexToMergeTo, edge.Target);
edgesToAdd.Add(newEdge);
Edge<int> newEdgeB = new Edge<int>(edge.Target, vertexToMergeTo);
edgesToAdd.Add(newEdgeB);
edgesToRemove.Add(edge);
Edge<int> newEdgeD = null;
graph.TryGetEdge(edge.Target, edge.Source, out newEdgeD);
edgesToRemove.Add(newEdgeD);
}
}
// remove old vertexes
foreach (Edge<int> edge in edgesToRemove)
{
graph.RemoveEdge(edge);
}
// remove old vertexes
foreach (Edge<int> edge in edgesToAdd)
{
graph.AddEdge(edge);
}
graph.RemoveVertex(vertexToDelete);
}
}
IEnumerable<Edge<int>> edges1 = new List<Edge<int>>();
IEnumerable<Edge<int>> edges2 = new List<Edge<int>>();
graph.TryGetOutEdges(graph.Vertices.ElementAt(0), out edges1);
graph.TryGetOutEdges(graph.Vertices.ElementAt(1), out edges2);
results.Add(edges1.Count());
Console.Write(results.Min());
Console.ReadLine();
}