60 lines
1.5 KiB
C#
60 lines
1.5 KiB
C#
|
using System.Collections.Generic;
|
||
|
|
||
|
namespace MoonTools.Core.Graph
|
||
|
{
|
||
|
abstract public class Graph<TNode, TEdgeData> where TNode : System.IEquatable<TNode>
|
||
|
{
|
||
|
protected HashSet<TNode> nodes = new HashSet<TNode>();
|
||
|
protected Dictionary<TNode, HashSet<TNode>> neighbors = new Dictionary<TNode, HashSet<TNode>>();
|
||
|
|
||
|
public IEnumerable<TNode> Nodes => nodes;
|
||
|
|
||
|
public int Order => nodes.Count;
|
||
|
|
||
|
public void AddNode(TNode node)
|
||
|
{
|
||
|
if (!Exists(node))
|
||
|
{
|
||
|
nodes.Add(node);
|
||
|
neighbors.Add(node, new HashSet<TNode>());
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public void AddNodes(params TNode[] nodes)
|
||
|
{
|
||
|
foreach (var node in nodes)
|
||
|
{
|
||
|
AddNode(node);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
public int Degree(TNode node)
|
||
|
{
|
||
|
CheckNodes(node);
|
||
|
return neighbors[node].Count;
|
||
|
}
|
||
|
|
||
|
public bool Exists(TNode node)
|
||
|
{
|
||
|
return nodes.Contains(node);
|
||
|
}
|
||
|
|
||
|
public IEnumerable<TNode> Neighbors(TNode node)
|
||
|
{
|
||
|
CheckNodes(node);
|
||
|
return neighbors[node];
|
||
|
}
|
||
|
|
||
|
protected void CheckNodes(params TNode[] givenNodes)
|
||
|
{
|
||
|
foreach (var node in givenNodes)
|
||
|
{
|
||
|
if (!Exists(node))
|
||
|
{
|
||
|
throw new System.ArgumentException($"Vertex {node} does not exist in the graph");
|
||
|
}
|
||
|
}
|
||
|
}
|
||
|
|
||
|
}
|
||
|
}
|