/// <summary> /// Instantiates a new MinimalSpanningTree. /// </summary> /// <param name="mstNodes">The GraphNodes that should be spanned. (not null)</param> /// <param name="distances">The DistanceLookup used as cache. (not null)</param> public MinimalSpanningTree(IReadOnlyList<int> mstNodes, IDistanceLookup distances) { if (mstNodes == null) throw new ArgumentNullException("mstNodes"); if (distances == null) throw new ArgumentNullException("distances"); _mstNodes = mstNodes; _distances = distances; }
/// <summary> /// Instantiates a new MinimalSpanningTree. /// </summary> /// <param name="mstNodes">The GraphNodes that should be spanned. (not null)</param> /// <param name="distances">The DistanceLookup used as cache. (not null)</param> public MinimalSpanningTree(IReadOnlyList <int> mstNodes, IDistanceLookup distances) { if (mstNodes == null) { throw new ArgumentNullException("mstNodes"); } if (distances == null) { throw new ArgumentNullException("distances"); } _mstNodes = mstNodes; _distances = distances; }
public BottleneckSteinerDistanceCalculator(IDistanceLookup distances) { _distances = distances; }