Commit e4d243fa authored by Tiago Peixoto's avatar Tiago Peixoto
Browse files

quickstart.rst: `assert` is not a function call

parent cae5227e
Pipeline #380 passed with stage
in 520 minutes and 3 seconds
...@@ -47,7 +47,7 @@ method. The "directedness" of the graph can be queried with the ...@@ -47,7 +47,7 @@ method. The "directedness" of the graph can be queried with the
>>> ug = Graph() >>> ug = Graph()
>>> ug.set_directed(False) >>> ug.set_directed(False)
>>> assert(ug.is_directed() == False) >>> assert ug.is_directed() == False
A graph can also be created by providing another graph, in which case A graph can also be created by providing another graph, in which case
the entire graph (and its internal property maps, see the entire graph (and its internal property maps, see
...@@ -311,7 +311,7 @@ and :meth:`~graph_tool.Vertex.in_neighbors` methods, respectively. ...@@ -311,7 +311,7 @@ and :meth:`~graph_tool.Vertex.in_neighbors` methods, respectively.
# the edge and neighbors order always match # the edge and neighbors order always match
for e, w in izip(v.out_edges(), v.out_neighbors()): for e, w in izip(v.out_edges(), v.out_neighbors()):
assert(e.target() == w) assert e.target() == w
The code above will print the out-edges and out-neighbors of all The code above will print the out-edges and out-neighbors of all
vertices in the graph. vertices in the graph.
......
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment