macierz sąsiedztwa

This results in a directed weighted adjacency matrix, of a fully connected network.

A better estimate of adjacency matrix may produce variations in the indices.

For use as a data structure, the main alternative to the adjacency matrix is the adjacency list.

With an adjacency matrix, an entire row must instead be scanned, which takes O(n) time.

In particular, the adjacency matrix of a strongly connected graph is irreducible.

Let A be the adjacency matrix of a network under consideration.

The result is another adjacency matrix, which stores the links for a network described by all the links in the parents.

Let A be the adjacency matrix of a graph.

It is also the adjacency matrix of the two-graph associated with G.

Since is a bipartite graph, we may consider its adjacency matrix.