/// <seealso cref="Graph.getAllEdges(Object, Object)">
/// </seealso>
public override System.Collections.IList getAllEdges(System.Object sourceVertex, System.Object targetVertex)
{
System.Collections.IList edges = null;
if (Enclosing_Instance.containsVertex(sourceVertex) && Enclosing_Instance.containsVertex(targetVertex))
{
edges = new System.Collections.ArrayList();
DirectedEdgeContainer ec = getEdgeContainer(sourceVertex);
System.Collections.IEnumerator iter = ec.m_outgoing.GetEnumerator();
//UPGRADE_TODO: Method 'java.util.Iterator.hasNext' was converted to 'System.Collections.IEnumerator.MoveNext' which has a different behavior. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1073_javautilIteratorhasNext'"
while (iter.MoveNext())
{
//UPGRADE_TODO: Method 'java.util.Iterator.next' was converted to 'System.Collections.IEnumerator.Current' which has a different behavior. "ms-help://MS.VSCC.v80/dv_commoner/local/redirect.htm?index='!DefaultContextWindowIndex'&keyword='jlca1073_javautilIteratornext'"
Edge e = (Edge)iter.Current;
if (e.Target.Equals(targetVertex))
{
edges.Add(e);
}
}
}
return(edges);
}
/// <summary> A lazy build of edge container for specified vertex.
///
/// </summary>
/// <param name="vertex">a vertex in this graph.
///
/// </param>
/// <returns> EdgeContainer
/// </returns>
private DirectedEdgeContainer getEdgeContainer(System.Object vertex)
{
Enclosing_Instance.assertVertexExist(vertex);
DirectedEdgeContainer ec = (DirectedEdgeContainer)Enclosing_Instance.m_vertexMap[vertex];
if (ec == null)
{
ec = new DirectedEdgeContainer(Enclosing_Instance.m_edgeListFactory, vertex);
Enclosing_Instance.m_vertexMap[vertex] = ec;
}
return(ec);
}
/// <summary> A lazy build of edge container for specified vertex.
///
/// </summary>
/// <param name="vertex">a vertex in this graph.
///
/// </param>
/// <returns> EdgeContainer
/// </returns>
private DirectedEdgeContainer getEdgeContainer(System.Object vertex)
{
Enclosing_Instance.assertVertexExist(vertex);
DirectedEdgeContainer ec = (DirectedEdgeContainer) Enclosing_Instance.m_vertexMap[vertex];
if (ec == null)
{
ec = new DirectedEdgeContainer(Enclosing_Instance.m_edgeListFactory, vertex);
Enclosing_Instance.m_vertexMap[vertex] = ec;
}
return ec;
}
