Leahnaya/pkmn-classic-framework
1
0
Fork 0
mirror of https://github.com/mm201/pkmn-classic-framework.git synced 2026-04-24 15:26:48 -05:00
Code Issues Actions Packages Projects Releases Wiki Activity

Moved DependencyGraph class to a more logical place.

Browse Source
This commit is contained in:
Greg Edwards 2015-01-23 17:32:15 -05:00
parent 436e2931a8
commit 82382f8678
2 changed files with 66 additions and 65 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

67
gts/src/DependencyNode.cs
View File

@ -2,10 +2,11 @@
using System.Collections.Generic;
using System.Linq;
using System.Web;
using System.Web.UI;
namespace PkmnFoundations.Web
{
public class DependencyNode<TKey, TValue>
internal class DependencyNode<TKey, TValue>
{
public DependencyNode()
{
@ -29,4 +30,68 @@ namespace PkmnFoundations.Web
public TValue Value { get; set; }
public HashSet<TKey> Dependencies { get; private set; }
}
internal class DependencyGraph<TKey, TValue>
{
public DependencyGraph()
{
Graph = new List<DependencyNode<TKey, TValue>>();
}
public DependencyGraph(List<DependencyNode<TKey, TValue>> graph)
{
Graph = graph;
}
public List<DependencyNode<TKey, TValue>> Graph;
public Page Page = null;
public List<TValue> Resolve()
{
// fixme: we should clone the DependencyNodes so they don't get modified.
LinkedList<DependencyNode<TKey, TValue>> nodesList = new LinkedList<DependencyNode<TKey, TValue>>(Graph);
List<TValue> result = new List<TValue>(nodesList.Count);
while (nodesList.Count > 0)
{
LinkedListNode<DependencyNode<TKey, TValue>> nodeLinked = nodesList.First;
while (nodeLinked != null)
{
if (nodeLinked.Value.Dependencies.Count == 0) break;
nodeLinked = nodeLinked.Next;
}
if (nodeLinked == null)
{
// we hit the end of the list without finding a dependency-less node.
// this means there has to be a circular dependency.
// ie. every remaining node in the list depends on some other remaining
// node in the list.
// todo: display the actual cycle (or an example if there's more than one)
// in this exception.
// algo:
// Keep a collection of found nodes.
// Start at the first node, adding it to the collection.
// Move to the node of the first dependency of this node and add it to the collection.
// Repeat until you reach a node which is already in the collection.
// Output the collection of nodes, starting at the node which was already found.
throw new Exception("Circular dependency found in your links.\n" +
"Keys:\n" +
String.Join("\n", nodesList.Select(n => n.Key).ToArray()));
}
// add this node to output, remove it as a dependency from the remaining nodes
DependencyNode<TKey, TValue> nodeOutput = nodeLinked.Value;
nodesList.Remove(nodeLinked);
foreach (DependencyNode<TKey, TValue> nodeValue in nodesList)
nodeValue.Dependencies.Remove(nodeOutput.Key);
result.Add(nodeOutput.Value);
}
return result;
}
}
}

64
gts/src/RequireLinkBase.cs
View File

@ -102,68 +102,4 @@ namespace PkmnFoundations.Web
link.RenderHeader(writer);
}
}
internal class DependencyGraph<TKey, TValue>
{
public DependencyGraph()
{
Graph = new List<DependencyNode<TKey, TValue>>();
}
public DependencyGraph(List<DependencyNode<TKey, TValue>> graph)
{
Graph = graph;
}
public List<DependencyNode<TKey, TValue>> Graph;
public Page Page = null;
public List<TValue> Resolve()
{
// fixme: we should clone the DependencyNodes so they don't get modified.
LinkedList<DependencyNode<TKey, TValue>> nodesList = new LinkedList<DependencyNode<TKey, TValue>>(Graph);
List<TValue> result = new List<TValue>(nodesList.Count);
while (nodesList.Count > 0)
{
LinkedListNode<DependencyNode<TKey, TValue>> nodeLinked = nodesList.First;
while (nodeLinked != null)
{
if (nodeLinked.Value.Dependencies.Count == 0) break;
nodeLinked = nodeLinked.Next;
}
if (nodeLinked == null)
{
// we hit the end of the list without finding a dependency-less node.
// this means there has to be a circular dependency.
// ie. every remaining node in the list depends on some other remaining
// node in the list.
// todo: display the actual cycle (or an example if there's more than one)
// in this exception.
// algo:
// Keep a collection of found nodes.
// Start at the first node, adding it to the collection.
// Move to the node of the first dependency of this node and add it to the collection.
// Repeat until you reach a node which is already in the collection.
// Output the collection of nodes, starting at the node which was already found.
throw new Exception("Circular dependency found in your links.\n" +
"Keys:\n" +
String.Join("\n", nodesList.Select(n => n.Key).ToArray()));
}
// add this node to output, remove it as a dependency from the remaining nodes
DependencyNode<TKey, TValue> nodeOutput = nodeLinked.Value;
nodesList.Remove(nodeLinked);
foreach (DependencyNode<TKey, TValue> nodeValue in nodesList)
nodeValue.Dependencies.Remove(nodeOutput.Key);
result.Add(nodeOutput.Value);
}
return result;
}
}
}