Keras Reinforcement Learning Projects
by Giuseppe Ciaburro, Sudharsan Ravichandiran, Suriyadeepan Ramamoorthy
The adjacency matrix
So far, we have represented a graph through vertices and edges. When the number of vertices is small, this way of representing a graph is the best one because it allows us to analyze its structure in an intuitive way. When the number of vertices becomes large, the graphic representation becomes confusing. In this case, it is better to represent the graph using the adjacency matrix. By adjacency matrix or connection matrix, we mean a particular data structure commonly used in graph representation. In particular, it is widely used in the drafting of algorithms that operate on graphs and in general in their computer representation. If it is a sparse matrix, the use of the adjacency list is preferable to the matrix.
Given ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access