/// <summary>
/// Returns all Edges that connect the two nodes (which are assumed to be different).
/// </summary>
/// <param name="node0"></param>
/// <param name="node1"></param>
/// <returns></returns>
public static IList getEdgesBetween(Node node0, Node node1)
{
IList edges0 = DirectedEdge.ToEdges(node0.OutEdges.Edges);
ISet commonEdges = new HashedSet(edges0);
IList edges1 = DirectedEdge.ToEdges(node1.OutEdges.Edges);
commonEdges.RetainAll(edges1);
return(new ArrayList(commonEdges));
}
/// <summary>
/// Returns all Edges that connect the two nodes (which are assumed to be different).
/// </summary>
/// <param name="node0"></param>
/// <param name="node1"></param>
/// <returns></returns>
public static IList getEdgesBetween(Node node0, Node node1)
{
IList edges0 = DirectedEdge.ToEdges(node0.OutEdges.Edges);
Set <DirectedEdge> commonEdges = new Set <DirectedEdge>(edges0.Cast <DirectedEdge>());
IList edges1 = DirectedEdge.ToEdges(node1.OutEdges.Edges);
commonEdges.RemoveMany(edges1.Cast <DirectedEdge>());
return(new ArrayList(commonEdges));
}
