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
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