question: public void createEdgesConnecting ( UniqueVertexGraph gGraph , String sStartNode , List lOtherNodes , HashMap hAppearenceHistogram ) { double dStartWeight = 0 ; double dIncreaseWeight = 0 ; if ( lOtherNodes != null ) if ( lOtherNodes . size ( ) == 0 ) { VertexImpl v = new VertexImpl ( ) ; v . setLabel ( sStartNode ) ; try { gGraph . add ( v ) ; } catch ( Exception e ) { e . printStackTrace ( ) ; } return ; } java . util . Iterator iIter = lOtherNodes . iterator ( ) ; Vertex vOldA = utils . locateVertexInGraph ( gGraph , sStartNode ) ; Vertex vA ; if ( vOldA != null ) vA = vOldA ; else { vA = new VertexImpl ( ) ; vA . setLabel ( sStartNode ) ; try { gGraph . add ( vA ) ; } catch ( Exception e ) { } } List lOldEdges ; lOldEdges = gGraph . getEdges ( vA ) ; int iCnt = 0 ; while ( iIter . hasNext ( ) ) { VertexImpl vB = new VertexImpl ( ) ; vB . setLabel ( ( String ) iIter . next ( ) ) ; double dOldWeight = 0 ; double dNewWeight = 0 ; dStartWeight = ScalingFunction ( ++ iCnt ) ; dIncreaseWeight = dStartWeight ; if ( eclLocator == null ) eclLocator = new EdgeCachedLocator ( 10 ) ; WeightedEdge weCorrectEdge = ( WeightedEdge ) eclLocator . locateDirectedEdgeInGraph ( gGraph , vA , vB ) ; if ( weCorrectEdge == null ) dNewWeight = dStartWeight ; else { dOldWeight = weCorrectEdge . getWeight ( ) ; dNewWeight = dOldWeight + dIncreaseWeight ; } try { if ( weCorrectEdge == null ) { WeightedEdge e = gGraph . addEdge ( vA , vB , dNewWeight ) ; eclLocator . addedEdge ( e ) ; } else weCorrectEdge . setWeight ( dNewWeight ) ; } catch ( Exception e ) { e . printStackTrace ( ) ; } } }
target:  Creates an edge in [gGraph] connecting [sBaseNode] to each node in the [lOtherNodes] list of nodes. If an edge exists, its weight is increased by [iIncreaseWeight], else its weight is set to [iStartWeight]