A graph representation method that uses a 2D array. Each row and
column corresponds to a node from the graph. If an edge exists between
two nodes, a 1 value is placed at the intersection of the two nodes;
otherwise, a 0 is stored to show that no edge exists.
Asynchronous
Separate execution streams that can run concurrently in any order
relative to each other are asynchronous.
You are currently reading a PREVIEW of this book.
Get instant access to over
$1 million worth of books and videos.