Jonas/WordGraph
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

clean up BFS function

Browse Source
This commit is contained in:
Jonas Seiler 2023-06-16 10:54:49 +02:00
parent 78c5cd5639
commit cfed832b8b
1 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
main.jl
View File

@ -74,17 +74,21 @@ function LevenshteinNeighbours(w::String)
return neighbours return neighbours
end end
function BFS(graph::Vector{node}) function BFS(g::Vector{node})
graph = deepcopy(g)
components = 0 components = 0
biggestComponent = 0 biggestComponent = 0
q = Queue{node}() q = Queue{node}()
for i in eachindex(graph) for i in eachindex(graph)
if graph[i].colored == false if graph[i].colored == false
components += 1 components += 1
currComponent = 1 currComponent = 1
enqueue!(q, graph[i]) enqueue!(q, graph[i])
graph[i].colored = true graph[i].colored = true
while !isempty(q) while !isempty(q)
n = dequeue!(q) n = dequeue!(q)
for m in n.neighbours for m in n.neighbours
@ -95,14 +99,16 @@ function BFS(graph::Vector{node})
end end
end end
end end
biggestComponent = max(biggestComponent, currComponent) biggestComponent = max(biggestComponent, currComponent)
if biggestComponent == currComponent if biggestComponent == currComponent
println("Wort: ", graph[i].word) println("Wort in der größten Komponente: ", graph[i].word)
end end
end end
end end
return components, biggestComponent println("Anzahl Zusammenhangskomponenten: ", components)
println("Größe der größten Zusammenhangskomponente: ", biggestComponent)
end end