Choosing data structure

Discussion in 'Java' started by majtits, May 4, 2010.

  1. majtits

    majtits New Member

    May 4, 2010
    Likes Received:
    Trophy Points:

    I'm having a problem with this program I want to write. I have bipartite graph and I first want to store vertex from the left side in array, and then under that every vertex I want to save all the edges, that go from that vertex to another (the number of edges varies). I've tries with ArrayList of ArrayList's but I have problems, with searching for existing vertices in the array. So if anyone knows for a better way, or knows how to realize that with ArrayList I would be very grateful.

Share This Page

  1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
    By continuing to use this site, you are consenting to our use of cookies.
    Dismiss Notice