Suite101

Computer Programming

© Mark Alexander Bain

Data Structure

  1. Guy Lecky-Thompson

Top
1.   Oct 4, 2006 5:58 AM

» Guy Lecky-Thompson - graph

In response to graph posted by ojha:
I'm not sure I understand. A graph with 4 edges would have 5 verteces (spellelling??), no? Unless is was a joined graph, then it would have 4.

Help me understand, and I'll help you with a solution. I probably won't give you a direct answer, though, as this sounds like math homework ;-)

Suite101
Guy Lecky-Thompson
Contributing Writer for Suite101


Post this Discussion Post to facebook Add this Discussion Post to del.icio.us! Digg this Discussion Post furl this Discussion Post Add this Discussion Post to Reddit Add this Discussion Post to Technorati Add this Discussion Post to Newsvine Add this Discussion Post to Windows Live Add this Discussion Post to Yahoo Add this Discussion Post to StumbleUpon Add this Discussion Post to BlinkLists Add this Discussion Post to Spurl Add this Discussion Post to Google Add this Discussion Post to Ask Add this Discussion Post to Squidoo

Please follow the guidelines set forth in the Suite101 Posting Etiquette when adding to the discussion.
about us • limelight blog • writing jobs • careers • press room • site map • terms & conditions • privacy policy • suite101.de