Is adjacency matrix representation and sparse matric representation the same?
Is adjacency matrix representation and sparse matric representation the same?
Paste that question into google. Next, click on the real spelling of it, then look at the wiki page.
If any good tutorials/videos/link on sparse matrix to represent graphs will be really helpfull.
for eg : how will the following graph be represented ...just to illustrate....
1--------2----------3------4
| |
| |
| 6
|
5
I actually couldn't find any good tutorials on this, but you could start with these.
Linked List representation
Boost Graph Library: Adjacency List
Just search around for some resources yourself . . . .
dwk
Seek and ye shall find. quaere et invenies.
"Simplicity does not precede complexity, but follows it." -- Alan Perlis
"Testing can only prove the presence of bugs, not their absence." -- Edsger Dijkstra
"The only real mistake is the one from which we learn nothing." -- John Powell
Other boards: DaniWeb, TPS
Unofficial Wiki FAQ: cpwiki.sf.net
My website: http://dwks.theprogrammingsite.com/
Projects: codeform, xuni, atlantis, nort, etc.
