mirror of
https://github.com/krahets/hello-algo.git
synced 2026-04-25 11:04:18 +08:00
2778a6f9c7
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
65 lines
2.0 KiB
Kotlin
65 lines
2.0 KiB
Kotlin
/**
|
|
* File: graph_bfs.kt
|
|
* Created Time: 2024-01-25
|
|
* Author: curtishd (1023632660@qq.com)
|
|
*/
|
|
|
|
package chapter_graph
|
|
|
|
import utils.Vertex
|
|
import java.util.*
|
|
|
|
/* Breadth-first traversal */
|
|
// Use adjacency list to represent the graph, in order to obtain all adjacent vertices of a specified vertex
|
|
fun graphBFS(graph: GraphAdjList, startVet: Vertex): MutableList<Vertex?> {
|
|
// Vertex traversal sequence
|
|
val res = mutableListOf<Vertex?>()
|
|
// Hash set for recording vertices that have been visited
|
|
val visited = HashSet<Vertex>()
|
|
visited.add(startVet)
|
|
// Queue used to implement BFS
|
|
val que = LinkedList<Vertex>()
|
|
que.offer(startVet)
|
|
// Starting from vertex vet, loop until all vertices are visited
|
|
while (!que.isEmpty()) {
|
|
val vet = que.poll() // Dequeue the front vertex
|
|
res.add(vet) // Record visited vertex
|
|
// Traverse all adjacent vertices of this vertex
|
|
for (adjVet in graph.adjList[vet]!!) {
|
|
if (visited.contains(adjVet))
|
|
continue // Skip vertices that have been visited
|
|
que.offer(adjVet) // Only enqueue unvisited vertices
|
|
visited.add(adjVet) // Mark this vertex as visited
|
|
}
|
|
}
|
|
// Return vertex traversal sequence
|
|
return res
|
|
}
|
|
|
|
/* Driver Code */
|
|
fun main() {
|
|
/* Add edge */
|
|
val v = Vertex.valsToVets(intArrayOf(0, 1, 2, 3, 4, 5, 6, 7, 8, 9))
|
|
val edges = arrayOf(
|
|
arrayOf(v[0], v[1]),
|
|
arrayOf(v[0], v[3]),
|
|
arrayOf(v[1], v[2]),
|
|
arrayOf(v[1], v[4]),
|
|
arrayOf(v[2], v[5]),
|
|
arrayOf(v[3], v[4]),
|
|
arrayOf(v[3], v[6]),
|
|
arrayOf(v[4], v[5]),
|
|
arrayOf(v[4], v[7]),
|
|
arrayOf(v[5], v[8]),
|
|
arrayOf(v[6], v[7]),
|
|
arrayOf(v[7], v[8])
|
|
)
|
|
val graph = GraphAdjList(edges)
|
|
println("\nAfter initialization, graph is")
|
|
graph.print()
|
|
|
|
/* Breadth-first traversal */
|
|
val res = graphBFS(graph, v[0]!!)
|
|
println("\nBreadth-first traversal (BFS) vertex sequence is")
|
|
println(Vertex.vetsToVals(res))
|
|
} |