undirected graph representation and Kruskal's algorithm

G

Gregor Rot

Hi,

i am interested in the fastest possible representation of an undirected
graph G=(V,E) (vertex, edge representation) in connection with the
Kruskal's algorithm (finding a minimal spanning tree)...anyway, what's
the best way to represent a graph in c (talking about data structures)?

tnx,
Greg
 
T

those who know me have no need of my name

in comp.lang.c i read:
i am interested in the fastest possible representation of

then you've posted to the wrong group. try something algorithms oriented.
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

No members online now.

Forum statistics

Threads
473,744
Messages
2,569,483
Members
44,903
Latest member
orderPeak8CBDGummies

Latest Threads

Top