@Ray Eldath did you paste that into the right thread?

versus python’s

graph = {}

graph['key'] = { items}

otherwise known as a map

the utility function to quickly build maps is

mapOf()

https://kotlinlang.org/api/latest/jvm/stdlib/kotlin.collections/map-of.html

but it sounds like you need more of a refresher on the basics rather than the stdlib

fwiw on JVM you do have access to the Java

LinkedList

for queues

though you might want a

mutableSetOf()

depending on how you’re building your graph

is what he says about the graph, the way to implement a graph?

it is conceptually the same as building a graph in python

kind meaning: type (as in does your graph always contain the same type), size, (un)directed , (a)cyclic

and it will also depend on what you want to do with the graph

you can make simple graphs with just (data) classes

data class Node(val name: String) ; data class Edge(val from: Node, val to: Node, val properties: Map<String,String>)

and you have a property graph

now if you have a 10 billion nodes graph, this is probably a really bad idea 😉