Two of the common operations on graphs are:
a) firstadj(v) - returns the index of the first vertex that is adjacent to
b) nextadj (v) - returns the index after index j, both are vertices
adjacent to v.
How to write a C procedures implemeting these two operations on the
adjacency lists and adjacency matrix representations.
and this is my another question... How to write a C program that builds a
binary heap by repeated insertion.
This forum is to help you to write your homework and not to make it
instead of you.
Learn your lesson and if you do not understand something then come and ask
me. But before asking you have to try hard. Asking should not be the first
[ back to toc ]