We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent b914497 commit c6f9a50Copy full SHA for c6f9a50
src/sage/graphs/base/dense_graph.pyx
@@ -101,8 +101,8 @@ It also contains the following variables::
101
.. NOTE::
102
103
As the edges are stored as the adjacency matrix of the graph, enumerating
104
- the edges of the graph has complexity O(n^2) and enumerating the neighbors
105
- of a vertex has complexity O(n) (where n in the size of the bitset
+ the edges of the graph has complexity `O(n^2)` and enumerating the neighbors
+ of a vertex has complexity `O(n)` (where `n` in the size of the bitset
106
active_vertices).
107
So, the class ``DenseGraph`` should be used for graphs such that the number
108
of edges is close to the square of the number of vertices.
0 commit comments