Keras Reinforcement Learning Projects

Adjacency lists

Adjacency lists are a mode of graph representation in memory. It is probably the most immediate representation to think about and the simplest to implement, even if in general not the most efficient in terms of occupied space.

Let's analyze a simple graph; next to each vertex is its list of adjacencies. The idea of representation is simply that a list is associated with every V_i vertex, containing all the V_j vertices so that there is an edge from V_i to V_j.

Assuming all pairs of the type (V_i, L), where L is the adjacency list of the V_i vertex, are stored, we obtain a unique description of the graph. Alternatively, if you decide to sort adjacency lists, you do not need to explicitly store the vertexes as well.

Let's look at ...