sweeety
IndoForum Beginner D
- No. Urut
- 86593
- Sejak
- 10 Des 2009
- Pesan
- 683
- Nilai reaksi
- 59
- Poin
- 28
sperti biasa...gw gatw thread ini taro dmn...tar d pindahkan saja y mod..hehehe /thx
mau tanyaaa...
gw punya algoritma ttg algoritma Prim..
procedur Prim (G: weighted connected undirected graph with n vertices)
T:= a minimum - weight edge
for i :=1 to n-2
begin
e:= an edge of minimum weight incident to a vertex in T and not forming a simple circuit in T if added to T
T:= T with e added
end
kalo di bahasa JAVA ngodingnya kaya gmn yah? gw coba ko ga bs2..:'(
terutama di bagian main ny, kaya gmn tuh?
help... /thx /thx
mau tanyaaa...
gw punya algoritma ttg algoritma Prim..
procedur Prim (G: weighted connected undirected graph with n vertices)
T:= a minimum - weight edge
for i :=1 to n-2
begin
e:= an edge of minimum weight incident to a vertex in T and not forming a simple circuit in T if added to T
T:= T with e added
end
kalo di bahasa JAVA ngodingnya kaya gmn yah? gw coba ko ga bs2..:'(
terutama di bagian main ny, kaya gmn tuh?
help... /thx /thx