Discuss all kind of algorithms and data structures from their mathematical and programming sides.
Moderators: Darobat, RecursiveS, Dante Shamest, Bugdude, Wizard
This way is able to check availability of edge between two vertices in O(1) time (like a adjacency matrix) and it is able to get list of edges, that adjacent with current vertices (like an adjacency list).
Only disadvantage that I see it's little increased memory cost as compared with adjacency list.
But in Cormen: "algorithms and data structures" it describes with hint from something more minuses.
P.S. Sory for my bad english.
- Posts: 1
- Joined: Mon Nov 08, 2010 4:32 pm
Return to Algorithms & Data Structures
Who is online
Users browsing this forum: No registered users and 2 guests