By using this site, you agree to our updated Privacy Policy and our Terms of Use. Manage your Cookies Settings.
446,205 Members | 977 Online
Bytes IT Community
+ Ask a Question
Need help? Post your question and get tips & solutions from a community of 446,205 IT Pros & Developers. It's quick & easy.

undirected graph representation and Kruskal's algorithm

P: n/a
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
Nov 14 '05 #1
Share this Question
Share on Google+
1 Reply


P: n/a
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.

--
a signature
Nov 14 '05 #2

This discussion thread is closed

Replies have been disabled for this discussion.