Skip to content

Commit 5eee8c4

Browse files
committed
add reference to the PR
1 parent 40ed899 commit 5eee8c4

File tree

2 files changed

+3
-3
lines changed

2 files changed

+3
-3
lines changed

src/sage/graphs/generic_graph.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -3580,7 +3580,7 @@ def multiple_edges(self, to_undirected=False, labels=True, sort=False, key=None)
35803580
[(1, 2, 'h'), (2, 1, 'g')]
35813581

35823582
Using the ``key`` argument to order multiple edges of incomparable
3583-
types::
3583+
types (see :trac:`35903`)::
35843584

35853585
sage: G = Graph([('A', 'B', 3), (1, 2, 1), ('A', 'B', 4), (1, 2, 2)], multiedges=True)
35863586
sage: G.multiple_edges(sort=True)
@@ -12619,7 +12619,7 @@ def edge_boundary(self, vertices1, vertices2=None, labels=True, sort=False, key=
1261912619
[(0, 1), (0, 2)]
1262012620

1262112621
Using the ``key`` argument to order multiple edges of incomparable
12622-
types::
12622+
types (see :trac:`35903`)::
1262312623

1262412624
sage: G = Graph([(1, 'A', 4), (1, 2, 3)])
1262512625
sage: G.edge_boundary([1], sort=True)

src/sage/graphs/graph.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1543,7 +1543,7 @@ def is_tree(self, certificate=False, output='vertex'):
15431543
sage: G.is_tree(certificate=True, output='edge')
15441544
(False, [(0, 0, None)])
15451545
1546-
Case of edges with incomparable types::
1546+
Case of edges with incomparable types (see :trac:`35903`)::
15471547
15481548
sage: G = Graph(multiedges=True)
15491549
sage: G.add_cycle(['A', 1, 2, 3])

0 commit comments

Comments
 (0)