Commit f1d3085

committed

Breadth first search graph traversal

1 parent 07c441d commit f1d3085Copy full SHA for f1d3085

File tree

+39

-2

lines changed

src/main/kotlin/pl/dmichalski/algorithms/data_structures/_11_graph_traversal
- Runner.kt
- UndirectedGraph.kt

+39

-2

lines changed

Lines changed: 8 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -26,6 +26,14 @@ object Runner {`
`26`	`26`	`depthFirstSearch = undirectedGraph.depthFirstSearchIterative(VERTEX_A)`
`27`	`27`	`println("Graph elements: $depthFirstSearch")`
`28`	`28`	`printUndirectedGraph(undirectedGraph)`
	`29`	`+`
	`30`	`+ println("------------------ Breadth First Search traversal ------------------ ")`
	`31`	`+ undirectedGraph = getUndirectedGraph()`
	`32`	`+ val breadthFirstSearch = undirectedGraph.breadthFirstSearch(VERTEX_A)`
	`33`	`+ println("Graph elements: $breadthFirstSearch")`
	`34`	`+ printUndirectedGraph(undirectedGraph)`
	`35`	`+`
	`36`	`+`
`29`	`37`	`}`
`30`	`38`
`31`	`39`	`/**`

Lines changed: 31 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -39,8 +39,11 @@ class UndirectedGraph {`
`39`	`39`	`result.add(node)`
`40`	`40`	`node.getConnections()`
`41`	`41`	`.map { con -> findNode(con) }`
`42`		`- .filter { neighbour -> !visited.contains(neighbour!!.getVertex()) }`
`43`		`- .forEach { neighbour -> dfs(neighbour) }`
	`42`	`+ .forEach { neighbour ->`
	`43`	`+ if (!visited.contains(neighbour?.getVertex())) {`
	`44`	`+ dfs(neighbour)`
	`45`	`+ }`
	`46`	`+ }`
`44`	`47`	`}`
`45`	`48`
`46`	`49`	`dfs(node)`
`@@ -72,6 +75,32 @@ class UndirectedGraph {`
`72`	`75`	`return result`
`73`	`76`	`}`
`74`	`77`
	`78`	`+`
	`79`	`+ fun breadthFirstSearch(vertex: String): MutableList<Node> {`
	`80`	`+ val queue = ArrayDeque<Node>()`
	`81`	`+ queue.push(findNode(vertex)!!)`
	`82`	`+ val result: MutableList<Node> = ArrayList()`
	`83`	`+ val visited: MutableSet<String> = HashSet()`
	`84`	`+ var currentVertex: Node?`
	`85`	`+`
	`86`	`+ visited.add(vertex)`
	`87`	`+ while (queue.size > 0) {`
	`88`	`+ currentVertex = queue.pop()`
	`89`	`+ result.add(currentVertex)`
	`90`	`+`
	`91`	`+ currentVertex.getConnections()`
	`92`	`+ .map { con -> findNode(con) }`
	`93`	`+ .filter { neighbour -> !visited.contains(neighbour!!.getVertex()) }`
	`94`	`+ .forEach { neighbour ->`
	`95`	`+ visited.add(neighbour!!.getVertex())`
	`96`	`+ queue.add(neighbour)`
	`97`	`+ }`
	`98`	`+ }`
	`99`	`+`
	`100`	`+ return result`
	`101`	`+ }`
	`102`	`+`
	`103`	`+`
`75`	`104`	`override fun toString(): String {`
`76`	`105`	`return "UndirectedGraph(adjacencyList='$adjacencyList')\n"`
`77`	`106`	`}`

Comments

(0)