From acccc58cf28d344740900d7f73bff5f2f61706b4 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Ma=C3=ABlle=20Salmon?= <maelle.salmon@yahoo.se>
Date: Thu, 12 Feb 2026 12:38:28 +0100
Subject: [PATCH] docs: workaround for too much autolinking

---
 man/E.Rd                                | 2 +-
 man/V.Rd                                | 2 +-
 man/add.edges.Rd                        | 2 +-
 man/add.vertices.Rd                     | 2 +-
 man/add_edges.Rd                        | 2 +-
 man/add_vertices.Rd                     | 2 +-
 man/adjacent.triangles.Rd               | 2 +-
 man/adjacent_vertices.Rd                | 2 +-
 man/aging.ba.game.Rd                    | 2 +-
 man/aging.barabasi.game.Rd              | 2 +-
 man/aging.prefatt.game.Rd               | 2 +-
 man/align_layout.Rd                     | 2 +-
 man/all_simple_paths.Rd                 | 2 +-
 man/alpha.centrality.Rd                 | 2 +-
 man/alpha_centrality.Rd                 | 2 +-
 man/are.connected.Rd                    | 2 +-
 man/are_adjacent.Rd                     | 2 +-
 man/articulation.points.Rd              | 2 +-
 man/articulation_points.Rd              | 2 +-
 man/as.directed.Rd                      | 2 +-
 man/as.igraph.Rd                        | 2 +-
 man/as.matrix.igraph.Rd                 | 2 +-
 man/as.undirected.Rd                    | 2 +-
 man/as_adj.Rd                           | 2 +-
 man/as_adj_list.Rd                      | 2 +-
 man/as_adjacency_matrix.Rd              | 2 +-
 man/as_biadjacency_matrix.Rd            | 2 +-
 man/as_directed.Rd                      | 2 +-
 man/as_edgelist.Rd                      | 2 +-
 man/as_graphnel.Rd                      | 2 +-
 man/as_incidence_matrix.Rd              | 2 +-
 man/as_long_data_frame.Rd               | 2 +-
 man/assortativity.Rd                    | 2 +-
 man/assortativity.degree.Rd             | 2 +-
 man/assortativity.nominal.Rd            | 2 +-
 man/asymmetric.preference.game.Rd       | 2 +-
 man/authority.score.Rd                  | 2 +-
 man/autocurve.edges.Rd                  | 2 +-
 man/automorphism_group.Rd               | 2 +-
 man/automorphisms.Rd                    | 2 +-
 man/average.path.length.Rd              | 2 +-
 man/ba.game.Rd                          | 2 +-
 man/barabasi.game.Rd                    | 2 +-
 man/betweenness.Rd                      | 2 +-
 man/bfs.Rd                              | 2 +-
 man/biconnected.components.Rd           | 2 +-
 man/biconnected_components.Rd           | 2 +-
 man/bipartite.mapping.Rd                | 2 +-
 man/bipartite.projection.Rd             | 2 +-
 man/bipartite.projection.size.Rd        | 2 +-
 man/bipartite.random.game.Rd            | 2 +-
 man/bipartite_mapping.Rd                | 2 +-
 man/bipartite_projection.Rd             | 2 +-
 man/bonpow.Rd                           | 2 +-
 man/callaway.traits.game.Rd             | 2 +-
 man/canonical.permutation.Rd            | 2 +-
 man/canonical_permutation.Rd            | 2 +-
 man/centr_betw.Rd                       | 2 +-
 man/centr_betw_tmax.Rd                  | 2 +-
 man/centr_clo.Rd                        | 2 +-
 man/centr_clo_tmax.Rd                   | 2 +-
 man/centr_degree.Rd                     | 2 +-
 man/centr_degree_tmax.Rd                | 2 +-
 man/centr_eigen.Rd                      | 2 +-
 man/centr_eigen_tmax.Rd                 | 2 +-
 man/centralization.betweenness.Rd       | 2 +-
 man/centralization.betweenness.tmax.Rd  | 2 +-
 man/centralization.closeness.Rd         | 2 +-
 man/centralization.closeness.tmax.Rd    | 2 +-
 man/centralization.degree.Rd            | 2 +-
 man/centralization.degree.tmax.Rd       | 2 +-
 man/centralization.evcent.Rd            | 2 +-
 man/centralization.evcent.tmax.Rd       | 2 +-
 man/centralize.Rd                       | 2 +-
 man/centralize.scores.Rd                | 2 +-
 man/cited.type.game.Rd                  | 2 +-
 man/citing.cited.type.game.Rd           | 2 +-
 man/clique.number.Rd                    | 2 +-
 man/cliques.Rd                          | 2 +-
 man/closeness.Rd                        | 2 +-
 man/cluster.distribution.Rd             | 2 +-
 man/cluster_edge_betweenness.Rd         | 2 +-
 man/cluster_fast_greedy.Rd              | 2 +-
 man/cluster_fluid_communities.Rd        | 2 +-
 man/cluster_infomap.Rd                  | 2 +-
 man/cluster_label_prop.Rd               | 2 +-
 man/cluster_leading_eigen.Rd            | 2 +-
 man/cluster_leiden.Rd                   | 2 +-
 man/cluster_louvain.Rd                  | 2 +-
 man/cluster_optimal.Rd                  | 2 +-
 man/cluster_spinglass.Rd                | 2 +-
 man/cluster_walktrap.Rd                 | 2 +-
 man/clusters.Rd                         | 2 +-
 man/cocitation.Rd                       | 2 +-
 man/cohesive.blocks.Rd                  | 2 +-
 man/cohesive_blocks.Rd                  | 2 +-
 man/communities.Rd                      | 2 +-
 man/compare.Rd                          | 2 +-
 man/complementer.Rd                     | 2 +-
 man/component_wise.Rd                   | 2 +-
 man/components.Rd                       | 2 +-
 man/compose.Rd                          | 2 +-
 man/connect.neighborhood.Rd             | 2 +-
 man/consensus_tree.Rd                   | 2 +-
 man/constraint.Rd                       | 2 +-
 man/contract.Rd                         | 2 +-
 man/contract.vertices.Rd                | 2 +-
 man/convex.hull.Rd                      | 2 +-
 man/convex_hull.Rd                      | 2 +-
 man/coreness.Rd                         | 2 +-
 man/count.multiple.Rd                   | 2 +-
 man/count_automorphisms.Rd              | 2 +-
 man/count_isomorphisms.Rd               | 2 +-
 man/count_motifs.Rd                     | 2 +-
 man/count_reachable.Rd                  | 2 +-
 man/count_subgraph_isomorphisms.Rd      | 2 +-
 man/count_triangles.Rd                  | 2 +-
 man/curve_multiple.Rd                   | 2 +-
 man/decompose.Rd                        | 2 +-
 man/decompose.graph.Rd                  | 2 +-
 man/degree.Rd                           | 2 +-
 man/degree.distribution.Rd              | 2 +-
 man/degree.sequence.game.Rd             | 2 +-
 man/delete.edges.Rd                     | 2 +-
 man/delete.vertices.Rd                  | 2 +-
 man/delete_edges.Rd                     | 2 +-
 man/delete_vertices.Rd                  | 2 +-
 man/dfs.Rd                              | 2 +-
 man/diameter.Rd                         | 2 +-
 man/difference.igraph.Rd                | 2 +-
 man/dim_select.Rd                       | 2 +-
 man/disjoint_union.Rd                   | 2 +-
 man/distances.Rd                        | 2 +-
 man/diversity.Rd                        | 2 +-
 man/dominator.tree.Rd                   | 2 +-
 man/dominator_tree.Rd                   | 2 +-
 man/dot-apply_modifiers.Rd              | 2 +-
 man/dyad.census.Rd                      | 2 +-
 man/dyad_census.Rd                      | 2 +-
 man/eccentricity.Rd                     | 2 +-
 man/edge.betweenness.Rd                 | 2 +-
 man/edge.betweenness.community.Rd       | 2 +-
 man/edge.connectivity.Rd                | 2 +-
 man/edge.disjoint.paths.Rd              | 2 +-
 man/edge_attr.Rd                        | 2 +-
 man/edge_connectivity.Rd                | 2 +-
 man/edge_density.Rd                     | 2 +-
 man/ego.Rd                              | 2 +-
 man/eigen_centrality.Rd                 | 2 +-
 man/embed_adjacency_matrix.Rd           | 2 +-
 man/embed_laplacian_matrix.Rd           | 2 +-
 man/ends.Rd                             | 2 +-
 man/erdos.renyi.game.Rd                 | 2 +-
 man/establishment.game.Rd               | 2 +-
 man/estimate_betweenness.Rd             | 2 +-
 man/estimate_closeness.Rd               | 2 +-
 man/estimate_edge_betweenness.Rd        | 2 +-
 man/evcent.Rd                           | 2 +-
 man/exportPajek.Rd                      | 2 +-
 man/farthest.nodes.Rd                   | 2 +-
 man/fastgreedy.community.Rd             | 2 +-
 man/feedback_arc_set.Rd                 | 2 +-
 man/feedback_vertex_set.Rd              | 2 +-
 man/find_cycle.Rd                       | 2 +-
 man/fit_hrg.Rd                          | 2 +-
 man/forest.fire.game.Rd                 | 2 +-
 man/from_incidence_matrix.Rd            | 2 +-
 man/get.adjacency.Rd                    | 2 +-
 man/get.adjedgelist.Rd                  | 2 +-
 man/get.adjlist.Rd                      | 2 +-
 man/get.all.shortest.paths.Rd           | 2 +-
 man/get.data.frame.Rd                   | 2 +-
 man/get.diameter.Rd                     | 2 +-
 man/get.edge.attribute.Rd               | 2 +-
 man/get.edge.ids.Rd                     | 2 +-
 man/get.edgelist.Rd                     | 2 +-
 man/get.incidence.Rd                    | 2 +-
 man/get.shortest.paths.Rd               | 2 +-
 man/get.stochastic.Rd                   | 2 +-
 man/get.vertex.attribute.Rd             | 2 +-
 man/get_edge_ids.Rd                     | 2 +-
 man/girth.Rd                            | 2 +-
 man/global_efficiency.Rd                | 2 +-
 man/gorder.Rd                           | 2 +-
 man/graph.Rd                            | 2 +-
 man/graph.adhesion.Rd                   | 2 +-
 man/graph.adjacency.Rd                  | 2 +-
 man/graph.adjlist.Rd                    | 2 +-
 man/graph.atlas.Rd                      | 2 +-
 man/graph.automorphisms.Rd              | 2 +-
 man/graph.bfs.Rd                        | 2 +-
 man/graph.bipartite.Rd                  | 2 +-
 man/graph.complementer.Rd               | 2 +-
 man/graph.compose.Rd                    | 2 +-
 man/graph.coreness.Rd                   | 2 +-
 man/graph.data.frame.Rd                 | 2 +-
 man/graph.de.bruijn.Rd                  | 2 +-
 man/graph.density.Rd                    | 2 +-
 man/graph.dfs.Rd                        | 2 +-
 man/graph.disjoint.union.Rd             | 2 +-
 man/graph.diversity.Rd                  | 2 +-
 man/graph.edgelist.Rd                   | 2 +-
 man/graph.empty.Rd                      | 2 +-
 man/graph.extended.chordal.ring.Rd      | 2 +-
 man/graph.famous.Rd                     | 2 +-
 man/graph.formula.Rd                    | 2 +-
 man/graph.full.Rd                       | 2 +-
 man/graph.full.bipartite.Rd             | 2 +-
 man/graph.full.citation.Rd              | 2 +-
 man/graph.graphdb.Rd                    | 2 +-
 man/graph.incidence.Rd                  | 2 +-
 man/graph.isocreate.Rd                  | 2 +-
 man/graph.kautz.Rd                      | 2 +-
 man/graph.knn.Rd                        | 2 +-
 man/graph.laplacian.Rd                  | 2 +-
 man/graph.lattice.Rd                    | 2 +-
 man/graph.lcf.Rd                        | 2 +-
 man/graph.maxflow.Rd                    | 2 +-
 man/graph.mincut.Rd                     | 2 +-
 man/graph.motifs.Rd                     | 2 +-
 man/graph.motifs.est.Rd                 | 2 +-
 man/graph.motifs.no.Rd                  | 2 +-
 man/graph.neighborhood.Rd               | 2 +-
 man/graph.ring.Rd                       | 2 +-
 man/graph.star.Rd                       | 2 +-
 man/graph.strength.Rd                   | 2 +-
 man/graph.tree.Rd                       | 2 +-
 man/graph.union.Rd                      | 2 +-
 man/graph_.Rd                           | 2 +-
 man/graph_center.Rd                     | 2 +-
 man/graph_from_adj_list.Rd              | 2 +-
 man/graph_from_adjacency_matrix.Rd      | 2 +-
 man/graph_from_atlas.Rd                 | 2 +-
 man/graph_from_biadjacency_matrix.Rd    | 2 +-
 man/graph_from_data_frame.Rd            | 2 +-
 man/graph_from_edgelist.Rd              | 2 +-
 man/graph_from_graphdb.Rd               | 2 +-
 man/graph_from_graphnel.Rd              | 2 +-
 man/graph_from_incidence_matrix.Rd      | 2 +-
 man/graph_from_isomorphism_class.Rd     | 2 +-
 man/graph_from_lcf.Rd                   | 2 +-
 man/graph_from_literal.Rd               | 2 +-
 man/graphlet_basis.Rd                   | 2 +-
 man/graphlets.candidate.basis.Rd        | 2 +-
 man/graphlets.project.Rd                | 2 +-
 man/greedy_vertex_coloring.Rd           | 2 +-
 man/grg.game.Rd                         | 2 +-
 man/growing.random.game.Rd              | 2 +-
 man/gsize.Rd                            | 2 +-
 man/handle_vertex_type_arg.Rd           | 2 +-
 man/harmonic_centrality.Rd              | 2 +-
 man/has.multiple.Rd                     | 2 +-
 man/has_eulerian_path.Rd                | 2 +-
 man/head_of.Rd                          | 2 +-
 man/hits_scores.Rd                      | 2 +-
 man/hrg.Rd                              | 2 +-
 man/hrg.consensus.Rd                    | 2 +-
 man/hrg.create.Rd                       | 2 +-
 man/hrg.dendrogram.Rd                   | 2 +-
 man/hrg.fit.Rd                          | 2 +-
 man/hrg.game.Rd                         | 2 +-
 man/hrg.predict.Rd                      | 2 +-
 man/hrg_tree.Rd                         | 2 +-
 man/hub.score.Rd                        | 2 +-
 man/hub_score.Rd                        | 2 +-
 man/igraph.from.graphNEL.Rd             | 2 +-
 man/igraph.sample.Rd                    | 2 +-
 man/igraph.to.graphNEL.Rd               | 2 +-
 man/igraph.version.Rd                   | 2 +-
 man/igraph_version.Rd                   | 2 +-
 man/incident.Rd                         | 2 +-
 man/incident_edges.Rd                   | 2 +-
 man/independence.number.Rd              | 2 +-
 man/independent.vertex.sets.Rd          | 2 +-
 man/induced.subgraph.Rd                 | 2 +-
 man/infomap.community.Rd                | 2 +-
 man/inside-square-error.Rd              | 2 +-
 man/interconnected.islands.game.Rd      | 2 +-
 man/intersection.igraph.Rd              | 2 +-
 man/invalidate_cache.Rd                 | 2 +-
 man/is.connected.Rd                     | 2 +-
 man/is.dag.Rd                           | 2 +-
 man/is.degree.sequence.Rd               | 2 +-
 man/is.directed.Rd                      | 2 +-
 man/is.graphical.degree.sequence.Rd     | 2 +-
 man/is.loop.Rd                          | 2 +-
 man/is.matching.Rd                      | 2 +-
 man/is.maximal.matching.Rd              | 2 +-
 man/is.minimal.separator.Rd             | 2 +-
 man/is.multiple.Rd                      | 2 +-
 man/is.mutual.Rd                        | 2 +-
 man/is.separator.Rd                     | 2 +-
 man/is.simple.Rd                        | 2 +-
 man/is_acyclic.Rd                       | 2 +-
 man/is_biconnected.Rd                   | 2 +-
 man/is_complete.Rd                      | 2 +-
 man/is_dag.Rd                           | 2 +-
 man/is_degseq.Rd                        | 2 +-
 man/is_directed.Rd                      | 2 +-
 man/is_forest.Rd                        | 2 +-
 man/is_graphical.Rd                     | 2 +-
 man/is_min_separator.Rd                 | 2 +-
 man/is_separator.Rd                     | 2 +-
 man/is_tree.Rd                          | 2 +-
 man/isomorphic.Rd                       | 2 +-
 man/isomorphism_class.Rd                | 2 +-
 man/isomorphisms.Rd                     | 2 +-
 man/ivs.Rd                              | 2 +-
 man/k.regular.game.Rd                   | 2 +-
 man/k_shortest_paths.Rd                 | 2 +-
 man/knn.Rd                              | 2 +-
 man/label.propagation.community.Rd      | 2 +-
 man/laplacian_matrix.Rd                 | 2 +-
 man/largest.cliques.Rd                  | 2 +-
 man/largest.independent.vertex.sets.Rd  | 2 +-
 man/lastcit.game.Rd                     | 2 +-
 man/layout.auto.Rd                      | 2 +-
 man/layout.bipartite.Rd                 | 2 +-
 man/layout.davidson.harel.Rd            | 2 +-
 man/layout.drl.Rd                       | 2 +-
 man/layout.fruchterman.reingold.grid.Rd | 2 +-
 man/layout.gem.Rd                       | 2 +-
 man/layout.grid.Rd                      | 2 +-
 man/layout.mds.Rd                       | 2 +-
 man/layout.spring.Rd                    | 2 +-
 man/layout.star.Rd                      | 2 +-
 man/layout.sugiyama.Rd                  | 2 +-
 man/layout.svd.Rd                       | 2 +-
 man/layout_as_bipartite.Rd              | 2 +-
 man/layout_as_star.Rd                   | 2 +-
 man/layout_as_tree.Rd                   | 2 +-
 man/layout_in_circle.Rd                 | 2 +-
 man/layout_nicely.Rd                    | 2 +-
 man/layout_on_grid.Rd                   | 2 +-
 man/layout_on_sphere.Rd                 | 2 +-
 man/layout_randomly.Rd                  | 2 +-
 man/layout_with_dh.Rd                   | 2 +-
 man/layout_with_drl.Rd                  | 2 +-
 man/layout_with_fr.Rd                   | 2 +-
 man/layout_with_gem.Rd                  | 2 +-
 man/layout_with_kk.Rd                   | 2 +-
 man/layout_with_lgl.Rd                  | 2 +-
 man/layout_with_mds.Rd                  | 2 +-
 man/layout_with_sugiyama.Rd             | 2 +-
 man/leading.eigenvector.community.Rd    | 2 +-
 man/line.graph.Rd                       | 2 +-
 man/local_scan.Rd                       | 2 +-
 man/make_.Rd                            | 2 +-
 man/make_bipartite_graph.Rd             | 2 +-
 man/make_chordal_ring.Rd                | 2 +-
 man/make_circulant.Rd                   | 2 +-
 man/make_de_bruijn_graph.Rd             | 2 +-
 man/make_empty_graph.Rd                 | 2 +-
 man/make_from_prufer.Rd                 | 2 +-
 man/make_full_bipartite_graph.Rd        | 2 +-
 man/make_full_citation_graph.Rd         | 2 +-
 man/make_full_graph.Rd                  | 2 +-
 man/make_full_multipartite.Rd           | 2 +-
 man/make_graph.Rd                       | 2 +-
 man/make_kautz_graph.Rd                 | 2 +-
 man/make_lattice.Rd                     | 2 +-
 man/make_line_graph.Rd                  | 2 +-
 man/make_ring.Rd                        | 2 +-
 man/make_star.Rd                        | 2 +-
 man/make_tree.Rd                        | 2 +-
 man/make_turan.Rd                       | 2 +-
 man/make_wheel.Rd                       | 2 +-
 man/matching.Rd                         | 2 +-
 man/max_cardinality.Rd                  | 2 +-
 man/max_flow.Rd                         | 2 +-
 man/maximal.cliques.Rd                  | 2 +-
 man/maximal.cliques.count.Rd            | 2 +-
 man/maximal.independent.vertex.sets.Rd  | 2 +-
 man/maximal_ivs.Rd                      | 2 +-
 man/maximum.bipartite.matching.Rd       | 2 +-
 man/maximum.cardinality.search.Rd       | 2 +-
 man/merge_coords.Rd                     | 2 +-
 man/min_cut.Rd                          | 2 +-
 man/min_separators.Rd                   | 2 +-
 man/min_st_separators.Rd                | 2 +-
 man/minimal.st.separators.Rd            | 2 +-
 man/minimum.size.separators.Rd          | 2 +-
 man/minimum.spanning.tree.Rd            | 2 +-
 man/mod.matrix.Rd                       | 2 +-
 man/modularity.igraph.Rd                | 2 +-
 man/motifs.Rd                           | 2 +-
 man/mst.Rd                              | 2 +-
 man/multilevel.community.Rd             | 2 +-
 man/neighborhood.size.Rd                | 2 +-
 man/neighbors.Rd                        | 2 +-
 man/optimal.community.Rd                | 2 +-
 man/page.rank.Rd                        | 2 +-
 man/page_rank.Rd                        | 2 +-
 man/path.length.hist.Rd                 | 2 +-
 man/permute.Rd                          | 2 +-
 man/permute.vertices.Rd                 | 2 +-
 man/piecewise.layout.Rd                 | 2 +-
 man/plot.igraph.Rd                      | 2 +-
 man/plotHierarchy.Rd                    | 2 +-
 man/power_centrality.Rd                 | 2 +-
 man/predict_edges.Rd                    | 2 +-
 man/preference.game.Rd                  | 2 +-
 man/print.igraph.Rd                     | 2 +-
 man/print.igraph.es.Rd                  | 2 +-
 man/print.igraph.vs.Rd                  | 2 +-
 man/radius.Rd                           | 2 +-
 man/random_walk.Rd                      | 2 +-
 man/read.graph.Rd                       | 2 +-
 man/read_graph.Rd                       | 2 +-
 man/realize_bipartite_degseq.Rd         | 2 +-
 man/realize_degseq.Rd                   | 2 +-
 man/reciprocity.Rd                      | 2 +-
 man/rep.igraph.Rd                       | 2 +-
 man/reverse_edges.Rd                    | 2 +-
 man/rglplot.Rd                          | 2 +-
 man/running.mean.Rd                     | 2 +-
 man/running_mean.Rd                     | 2 +-
 man/sample_.Rd                          | 2 +-
 man/sample_bipartite.Rd                 | 2 +-
 man/sample_bipartite_gnm.Rd             | 2 +-
 man/sample_chung_lu.Rd                  | 2 +-
 man/sample_correlated_gnp.Rd            | 2 +-
 man/sample_correlated_gnp_pair.Rd       | 2 +-
 man/sample_degseq.Rd                    | 2 +-
 man/sample_dirichlet.Rd                 | 2 +-
 man/sample_dot_product.Rd               | 2 +-
 man/sample_fitness.Rd                   | 2 +-
 man/sample_fitness_pl.Rd                | 2 +-
 man/sample_forestfire.Rd                | 2 +-
 man/sample_gnm.Rd                       | 2 +-
 man/sample_gnp.Rd                       | 2 +-
 man/sample_grg.Rd                       | 2 +-
 man/sample_growing.Rd                   | 2 +-
 man/sample_hierarchical_sbm.Rd          | 2 +-
 man/sample_hrg.Rd                       | 2 +-
 man/sample_islands.Rd                   | 2 +-
 man/sample_k_regular.Rd                 | 2 +-
 man/sample_last_cit.Rd                  | 2 +-
 man/sample_motifs.Rd                    | 2 +-
 man/sample_pa.Rd                        | 2 +-
 man/sample_pa_age.Rd                    | 2 +-
 man/sample_pref.Rd                      | 2 +-
 man/sample_sbm.Rd                       | 2 +-
 man/sample_seq.Rd                       | 2 +-
 man/sample_smallworld.Rd                | 2 +-
 man/sample_spanning_tree.Rd             | 2 +-
 man/sample_sphere_surface.Rd            | 2 +-
 man/sample_sphere_volume.Rd             | 2 +-
 man/sample_traits_callaway.Rd           | 2 +-
 man/sample_tree.Rd                      | 2 +-
 man/sbm.game.Rd                         | 2 +-
 man/scan_stat.Rd                        | 2 +-
 man/set.edge.attribute.Rd               | 2 +-
 man/set.vertex.attribute.Rd             | 2 +-
 man/set_edge_attr.Rd                    | 2 +-
 man/set_vertex_attr.Rd                  | 2 +-
 man/set_vertex_attrs.Rd                 | 2 +-
 man/shortest.paths.Rd                   | 2 +-
 man/similarity.Rd                       | 2 +-
 man/similarity.dice.Rd                  | 2 +-
 man/similarity.invlogweighted.Rd        | 2 +-
 man/similarity.jaccard.Rd               | 2 +-
 man/simple_cycles.Rd                    | 2 +-
 man/simplify.Rd                         | 2 +-
 man/sir.Rd                              | 2 +-
 man/spinglass.community.Rd              | 2 +-
 man/split_join_distance.Rd              | 2 +-
 man/stCuts.Rd                           | 2 +-
 man/stMincuts.Rd                        | 2 +-
 man/st_cuts.Rd                          | 2 +-
 man/st_min_cuts.Rd                      | 2 +-
 man/static.fitness.game.Rd              | 2 +-
 man/static.power.law.game.Rd            | 2 +-
 man/stochastic_matrix.Rd                | 2 +-
 man/strength.Rd                         | 2 +-
 man/subcomponent.Rd                     | 2 +-
 man/subgraph.Rd                         | 2 +-
 man/subgraph.centrality.Rd              | 2 +-
 man/subgraph.edges.Rd                   | 2 +-
 man/subgraph_centrality.Rd              | 2 +-
 man/subgraph_isomorphic.Rd              | 2 +-
 man/subgraph_isomorphisms.Rd            | 2 +-
 man/tail_of.Rd                          | 2 +-
 man/tkplot.Rd                           | 2 +-
 man/tkplot.center.Rd                    | 2 +-
 man/tkplot.fit.to.screen.Rd             | 2 +-
 man/tkplot.reshape.Rd                   | 2 +-
 man/tkplot.rotate.Rd                    | 2 +-
 man/tkplot.setcoords.Rd                 | 2 +-
 man/to_prufer.Rd                        | 2 +-
 man/topo_sort.Rd                        | 2 +-
 man/topological.sort.Rd                 | 2 +-
 man/transitive_closure.Rd               | 2 +-
 man/transitivity.Rd                     | 2 +-
 man/triad.census.Rd                     | 2 +-
 man/triad_census.Rd                     | 2 +-
 man/unfold.tree.Rd                      | 2 +-
 man/unfold_tree.Rd                      | 2 +-
 man/union.igraph.Rd                     | 2 +-
 man/upgrade_graph.Rd                    | 2 +-
 man/vertex.connectivity.Rd              | 2 +-
 man/vertex.disjoint.paths.Rd            | 2 +-
 man/vertex_attr.Rd                      | 2 +-
 man/vertex_connectivity.Rd              | 2 +-
 man/voronoi_cells.Rd                    | 2 +-
 man/walktrap.community.Rd               | 2 +-
 man/watts.strogatz.game.Rd              | 2 +-
 man/weighted_cliques.Rd                 | 2 +-
 man/which_multiple.Rd                   | 2 +-
 man/which_mutual.Rd                     | 2 +-
 man/write.graph.Rd                      | 2 +-
 man/write_graph.Rd                      | 2 +-
 512 files changed, 512 insertions(+), 512 deletions(-)

diff --git a/man/E.Rd b/man/E.Rd
index 8ce0179d2bc..40ad78906d5 100644
--- a/man/E.Rd
+++ b/man/E.Rd
@@ -59,7 +59,7 @@ edges in the sequence. See \code{\link[=$.igraph.es]{$.igraph.es()}} for details
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/V.Rd b/man/V.Rd
index 3e54ed4db80..d3c43078786 100644
--- a/man/V.Rd
+++ b/man/V.Rd
@@ -52,7 +52,7 @@ vertices in the sequence. See \code{\link[=$.igraph.vs]{$.igraph.vs()}} for deta
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/add.edges.Rd b/man/add.edges.Rd
index 0c2fc925a37..709091ac5ee 100644
--- a/man/add.edges.Rd
+++ b/man/add.edges.Rd
@@ -27,7 +27,7 @@ below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/add.vertices.Rd b/man/add.vertices.Rd
index 67cf024dce0..f536d296cfd 100644
--- a/man/add.vertices.Rd
+++ b/man/add.vertices.Rd
@@ -26,7 +26,7 @@ below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/add_edges.Rd b/man/add_edges.Rd
index b7696830228..b669f5f3c19 100644
--- a/man/add_edges.Rd
+++ b/man/add_edges.Rd
@@ -34,7 +34,7 @@ If attributes are supplied, and they are not present in the graph,
 their values for the original edges of the graph are set to \code{NA}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/add_vertices.Rd b/man/add_vertices.Rd
index 542203ac40d..507d4aa5e2f 100644
--- a/man/add_vertices.Rd
+++ b/man/add_vertices.Rd
@@ -28,7 +28,7 @@ their values for the original vertices of the graph are set to
 \code{NA}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/adjacent.triangles.Rd b/man/adjacent.triangles.Rd
index 759c85ff7d5..534e2cb4acd 100644
--- a/man/adjacent.triangles.Rd
+++ b/man/adjacent.triangles.Rd
@@ -21,7 +21,7 @@ named graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_count_adjacent_triangles}{\code{count_adjacent_triangles()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_count_adjacent_triangles}{\code{count_adjacent_triangles}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/adjacent_vertices.Rd b/man/adjacent_vertices.Rd
index 7cd87e429d2..dd52901f8ed 100644
--- a/man/adjacent_vertices.Rd
+++ b/man/adjacent_vertices.Rd
@@ -23,7 +23,7 @@ This function is similar to \code{\link[=neighbors]{neighbors()}}, but it querie
 the adjacent vertices for multiple vertices at once.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/aging.ba.game.Rd b/man/aging.ba.game.Rd
index dc615662e41..0b36ccac7db 100644
--- a/man/aging.ba.game.Rd
+++ b/man/aging.ba.game.Rd
@@ -72,7 +72,7 @@ attachment. See also details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game}}
 }
 
 \keyword{internal}
diff --git a/man/aging.barabasi.game.Rd b/man/aging.barabasi.game.Rd
index c5dc471b881..4135391a19d 100644
--- a/man/aging.barabasi.game.Rd
+++ b/man/aging.barabasi.game.Rd
@@ -72,7 +72,7 @@ attachment. See also details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game}}
 }
 
 \keyword{internal}
diff --git a/man/aging.prefatt.game.Rd b/man/aging.prefatt.game.Rd
index 77e357d4b9d..94e54a48123 100644
--- a/man/aging.prefatt.game.Rd
+++ b/man/aging.prefatt.game.Rd
@@ -72,7 +72,7 @@ attachment. See also details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game}}
 }
 
 \keyword{internal}
diff --git a/man/align_layout.Rd b/man/align_layout.Rd
index bfb62b60c53..15e21eafd14 100644
--- a/man/align_layout.Rd
+++ b/man/align_layout.Rd
@@ -24,7 +24,7 @@ rotates the layout to achieve a visually pleasing alignment with the coordinate
 axes. Doing this is particularly useful with force-directed layouts such as \code{\link[=layout_with_fr]{layout_with_fr()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align}}
 }
 
 \examples{
diff --git a/man/all_simple_paths.Rd b/man/all_simple_paths.Rd
index fb3c90f7364..cb2cce90b76 100644
--- a/man/all_simple_paths.Rd
+++ b/man/all_simple_paths.Rd
@@ -46,7 +46,7 @@ function, if your graph is lattice-like.
 This function ignores multiple and loop edges.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_simple_paths}{\code{get_all_simple_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_simple_paths}{\code{get_all_simple_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/alpha.centrality.Rd b/man/alpha.centrality.Rd
index 06576dd5f4b..3fac14068e4 100644
--- a/man/alpha.centrality.Rd
+++ b/man/alpha.centrality.Rd
@@ -55,7 +55,7 @@ support}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/alpha_centrality.Rd b/man/alpha_centrality.Rd
index 34bf22bb03a..7d262a9a739 100644
--- a/man/alpha_centrality.Rd
+++ b/man/alpha_centrality.Rd
@@ -74,7 +74,7 @@ algorithm, the routine may fail is certain cases.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/are.connected.Rd b/man/are.connected.Rd
index 6bc190f881c..bfa407556b6 100644
--- a/man/are.connected.Rd
+++ b/man/are.connected.Rd
@@ -20,7 +20,7 @@ are.connected(graph, v1, v2)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/are_adjacent.Rd b/man/are_adjacent.Rd
index de81ef151ac..022922a88e2 100644
--- a/man/are_adjacent.Rd
+++ b/man/are_adjacent.Rd
@@ -21,7 +21,7 @@ The order of the vertices only matters in directed graphs,
 where the existence of a directed \verb{(v1, v2)} edge is queried.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_are_adjacent}{\code{are_adjacent}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/articulation.points.Rd b/man/articulation.points.Rd
index 05dad4a7ad2..cb0d9515359 100644
--- a/man/articulation.points.Rd
+++ b/man/articulation.points.Rd
@@ -17,7 +17,7 @@ it is directed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/articulation_points.Rd b/man/articulation_points.Rd
index 7ec9051140b..0f6ccd0ecea 100644
--- a/man/articulation_points.Rd
+++ b/man/articulation_points.Rd
@@ -31,7 +31,7 @@ contains no articulation points, then its vertex connectivity is at least
 two.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_bridges}{\code{bridges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_articulation_points}{\code{articulation_points}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_bridges}{\code{bridges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/as.directed.Rd b/man/as.directed.Rd
index f2d4dac32d0..837849a5dc2 100644
--- a/man/as.directed.Rd
+++ b/man/as.directed.Rd
@@ -21,7 +21,7 @@ as.directed(graph, mode = c("mutual", "arbitrary", "random", "acyclic"))
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_directed}{\code{to_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_directed}{\code{to_directed}}
 }
 
 \keyword{internal}
diff --git a/man/as.igraph.Rd b/man/as.igraph.Rd
index 794b14f1031..94742d6cd16 100644
--- a/man/as.igraph.Rd
+++ b/man/as.igraph.Rd
@@ -25,7 +25,7 @@ These objects are created by the \code{\link[=fit_hrg]{fit_hrg()}} and
 \code{\link[=consensus_tree]{consensus_tree()}} functions.  }
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}
 }
 
 \examples{
diff --git a/man/as.matrix.igraph.Rd b/man/as.matrix.igraph.Rd
index 08d14ef8a93..7b4fc750d60 100644
--- a/man/as.matrix.igraph.Rd
+++ b/man/as.matrix.igraph.Rd
@@ -36,7 +36,7 @@ Other arguments passed through \code{...} are passed to either
 depending on the value of \code{matrix.type}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/as.undirected.Rd b/man/as.undirected.Rd
index 1a0ae66f3f4..7008e0efdce 100644
--- a/man/as.undirected.Rd
+++ b/man/as.undirected.Rd
@@ -31,7 +31,7 @@ this.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_undirected}{\code{to_undirected()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_undirected}{\code{to_undirected}}
 }
 
 \keyword{internal}
diff --git a/man/as_adj.Rd b/man/as_adj.Rd
index 61f797bb585..7d4cdde1186 100644
--- a/man/as_adj.Rd
+++ b/man/as_adj.Rd
@@ -52,7 +52,7 @@ We plan to remove \code{as_adj()} in favor of the more explicitly named
 \code{as_adjacency_matrix()} so please use \code{as_adjacency_matrix()} instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/as_adj_list.Rd b/man/as_adj_list.Rd
index e7c389dbddf..0fcf995a17b 100644
--- a/man/as_adj_list.Rd
+++ b/man/as_adj_list.Rd
@@ -56,7 +56,7 @@ vectors of the adjacency lists are coerced to \code{igraph.vs}, this can be
 a very expensive operation on large graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/as_adjacency_matrix.Rd b/man/as_adjacency_matrix.Rd
index 30ba206fbae..837da113edc 100644
--- a/man/as_adjacency_matrix.Rd
+++ b/man/as_adjacency_matrix.Rd
@@ -61,7 +61,7 @@ defined in the \sQuote{\code{Matrix}} package, if \code{sparse} if
 \code{TRUE}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/as_biadjacency_matrix.Rd b/man/as_biadjacency_matrix.Rd
index 2854bd924d2..1c0b6c81859 100644
--- a/man/as_biadjacency_matrix.Rd
+++ b/man/as_biadjacency_matrix.Rd
@@ -53,7 +53,7 @@ Some authors refer to the bipartite adjacency matrix as the
 this naming to avoid confusion with the edge-vertex incidence matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/as_directed.Rd b/man/as_directed.Rd
index 2efa06f57ad..9129c0cf8db 100644
--- a/man/as_directed.Rd
+++ b/man/as_directed.Rd
@@ -85,7 +85,7 @@ than one mutual edge pairs between the same pair of vertices.
 }
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_directed}{\code{to_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_undirected}{\code{to_undirected()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_directed}{\code{to_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_undirected}{\code{to_undirected}}
 }
 
 \examples{
diff --git a/man/as_edgelist.Rd b/man/as_edgelist.Rd
index 1bc4ecf7e25..79352e37108 100644
--- a/man/as_edgelist.Rd
+++ b/man/as_edgelist.Rd
@@ -24,7 +24,7 @@ graph, like an edge list.
 \code{as_edgelist()} returns the list of edges in a graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/as_graphnel.Rd b/man/as_graphnel.Rd
index fa87ed06fbd..b776ee4993e 100644
--- a/man/as_graphnel.Rd
+++ b/man/as_graphnel.Rd
@@ -25,7 +25,7 @@ vertex names in the graphNEL graph. Otherwise numeric igraph vertex ids
 will be used for this purpose.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/as_incidence_matrix.Rd b/man/as_incidence_matrix.Rd
index 90f90e19848..bddc5c2a024 100644
--- a/man/as_incidence_matrix.Rd
+++ b/man/as_incidence_matrix.Rd
@@ -18,7 +18,7 @@ Some authors refer to the bipartite adjacency matrix as the
 this naming to avoid confusion with the edge-vertex incidence matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/as_long_data_frame.Rd b/man/as_long_data_frame.Rd
index d036591d7f1..260971b9343 100644
--- a/man/as_long_data_frame.Rd
+++ b/man/as_long_data_frame.Rd
@@ -23,7 +23,7 @@ they contain the numeric ids of the incident vertices. The rows are
 listed in the order of numeric vertex ids.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/assortativity.Rd b/man/assortativity.Rd
index 29dfc31907b..b3de5562493 100644
--- a/man/assortativity.Rd
+++ b/man/assortativity.Rd
@@ -109,7 +109,7 @@ Undirected graphs are effectively treated as directed ones with all-reciprocal e
 Thus, self-loops are taken into account twice in undirected graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity}{\code{assortativity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity}{\code{assortativity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree}}
 }
 
 \examples{
diff --git a/man/assortativity.degree.Rd b/man/assortativity.degree.Rd
index 74725be0a54..c8406551c0c 100644
--- a/man/assortativity.degree.Rd
+++ b/man/assortativity.degree.Rd
@@ -24,7 +24,7 @@ graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_degree}{\code{assortativity_degree}}
 }
 
 \keyword{internal}
diff --git a/man/assortativity.nominal.Rd b/man/assortativity.nominal.Rd
index a2236ceca3b..f8b836672ee 100644
--- a/man/assortativity.nominal.Rd
+++ b/man/assortativity.nominal.Rd
@@ -34,7 +34,7 @@ values at the two ends of edges.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_assortativity_nominal}{\code{assortativity_nominal}}
 }
 
 \keyword{internal}
diff --git a/man/asymmetric.preference.game.Rd b/man/asymmetric.preference.game.Rd
index 533bc66fb53..bcb752fb48e 100644
--- a/man/asymmetric.preference.game.Rd
+++ b/man/asymmetric.preference.game.Rd
@@ -33,7 +33,7 @@ an undirected graph, it must be symmetric.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_asymmetric_preference_game}{\code{asymmetric_preference_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_asymmetric_preference_game}{\code{asymmetric_preference_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/authority.score.Rd b/man/authority.score.Rd
index 667f52733de..160589e93d0 100644
--- a/man/authority.score.Rd
+++ b/man/authority.score.Rd
@@ -35,7 +35,7 @@ selected by the surfer.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/autocurve.edges.Rd b/man/autocurve.edges.Rd
index 536f641bc4b..b1b1710ac32 100644
--- a/man/autocurve.edges.Rd
+++ b/man/autocurve.edges.Rd
@@ -19,7 +19,7 @@ curvature between \code{-start} and \code{start}, spaced equally.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/automorphism_group.Rd b/man/automorphism_group.Rd
index b160fcd9bb9..9c5b2e0075e 100644
--- a/man/automorphism_group.Rd
+++ b/man/automorphism_group.Rd
@@ -72,7 +72,7 @@ generating set is not necessarily minimal, and it may depend on the splitting
 heuristics used by BLISS.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_automorphism_group}{\code{automorphism_group()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_automorphism_group}{\code{automorphism_group}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/automorphisms.Rd b/man/automorphisms.Rd
index c04952a9838..ba0288447ee 100644
--- a/man/automorphisms.Rd
+++ b/man/automorphisms.Rd
@@ -44,7 +44,7 @@ first smallest maximally non-trivially connected non-singleton cell.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/average.path.length.Rd b/man/average.path.length.Rd
index f2fb38059ee..23a1264fd48 100644
--- a/man/average.path.length.Rd
+++ b/man/average.path.length.Rd
@@ -42,7 +42,7 @@ the result when this parameter is set to \code{TRUE}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/ba.game.Rd b/man/ba.game.Rd
index 7dec0251114..7d05183c75b 100644
--- a/man/ba.game.Rd
+++ b/man/ba.game.Rd
@@ -72,7 +72,7 @@ contain the out degrees of the new vertices only, not the ones in the
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/barabasi.game.Rd b/man/barabasi.game.Rd
index 16159224634..52c02802c7b 100644
--- a/man/barabasi.game.Rd
+++ b/man/barabasi.game.Rd
@@ -72,7 +72,7 @@ contain the out degrees of the new vertices only, not the ones in the
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/betweenness.Rd b/man/betweenness.Rd
index 6839eb7dcee..847336a0d78 100644
--- a/man/betweenness.Rd
+++ b/man/betweenness.Rd
@@ -97,7 +97,7 @@ Brandes (see References) is used.
 multiple edges.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_betweenness_cutoff}{\code{betweenness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_betweenness_cutoff}{\code{betweenness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff}}
 }
 
 \examples{
diff --git a/man/bfs.Rd b/man/bfs.Rd
index 24ae136772b..25b0e66c4e3 100644
--- a/man/bfs.Rd
+++ b/man/bfs.Rd
@@ -140,7 +140,7 @@ to continue the search or \code{TRUE} to terminate it. See examples below on how
 use the callback function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/biconnected.components.Rd b/man/biconnected.components.Rd
index 43d62a46e92..0242128ce2a 100644
--- a/man/biconnected.components.Rd
+++ b/man/biconnected.components.Rd
@@ -17,7 +17,7 @@ it is directed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/biconnected_components.Rd b/man/biconnected_components.Rd
index a7777b5b4f1..cf574d10b07 100644
--- a/man/biconnected_components.Rd
+++ b/man/biconnected_components.Rd
@@ -46,7 +46,7 @@ that this is not true for vertices: the same vertex can be part of many
 biconnected components.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_biconnected_components}{\code{biconnected_components}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/bipartite.mapping.Rd b/man/bipartite.mapping.Rd
index eae9cf6f060..5fd9075951c 100644
--- a/man/bipartite.mapping.Rd
+++ b/man/bipartite.mapping.Rd
@@ -16,7 +16,7 @@ bipartite.mapping(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/bipartite.projection.Rd b/man/bipartite.projection.Rd
index ba437528826..fd2428d831c 100644
--- a/man/bipartite.projection.Rd
+++ b/man/bipartite.projection.Rd
@@ -49,7 +49,7 @@ default it will be removed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/bipartite.projection.size.Rd b/man/bipartite.projection.size.Rd
index 1922a4b10a4..ea93f1a63ca 100644
--- a/man/bipartite.projection.size.Rd
+++ b/man/bipartite.projection.size.Rd
@@ -21,7 +21,7 @@ graph has no \sQuote{\code{type}} vertex attribute.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/bipartite.random.game.Rd b/man/bipartite.random.game.Rd
index eb33c8309cc..8c35a2a8980 100644
--- a/man/bipartite.random.game.Rd
+++ b/man/bipartite.random.game.Rd
@@ -46,7 +46,7 @@ is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/bipartite_mapping.Rd b/man/bipartite_mapping.Rd
index b5b1c32cabe..3bd3c293c25 100644
--- a/man/bipartite_mapping.Rd
+++ b/man/bipartite_mapping.Rd
@@ -42,7 +42,7 @@ least two components, then the vertices in the separate components can be
 mapped independently.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_is_bipartite}{\code{is_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/bipartite_projection.Rd b/man/bipartite_projection.Rd
index 37e8ccfbe21..1bda20b65a4 100644
--- a/man/bipartite_projection.Rd
+++ b/man/bipartite_projection.Rd
@@ -69,7 +69,7 @@ the second.
 \code{bipartite_projection()} keeps vertex attributes.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_projection_size}{\code{bipartite_projection_size}}
 }
 
 \examples{
diff --git a/man/bonpow.Rd b/man/bonpow.Rd
index 521a629586a..be035e8c472 100644
--- a/man/bonpow.Rd
+++ b/man/bonpow.Rd
@@ -44,7 +44,7 @@ support}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/callaway.traits.game.Rd b/man/callaway.traits.game.Rd
index 1ae0913531e..9b3b564375d 100644
--- a/man/callaway.traits.game.Rd
+++ b/man/callaway.traits.game.Rd
@@ -35,7 +35,7 @@ types. These should be probabilities, i.e. numbers between zero and one.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_callaway_traits_game}{\code{callaway_traits_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_callaway_traits_game}{\code{callaway_traits_game}}
 }
 
 \keyword{internal}
diff --git a/man/canonical.permutation.Rd b/man/canonical.permutation.Rd
index d7de6784375..8278d00810e 100644
--- a/man/canonical.permutation.Rd
+++ b/man/canonical.permutation.Rd
@@ -30,7 +30,7 @@ for possible values.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/canonical_permutation.Rd b/man/canonical_permutation.Rd
index 7d5424bb5fe..497d6e3c1e8 100644
--- a/man/canonical_permutation.Rd
+++ b/man/canonical_permutation.Rd
@@ -94,7 +94,7 @@ See the paper in references for details
 about these.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_canonical_permutation}{\code{canonical_permutation}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/centr_betw.Rd b/man/centr_betw.Rd
index 0be566d7d56..1afca1a5811 100644
--- a/man/centr_betw.Rd
+++ b/man/centr_betw.Rd
@@ -37,7 +37,7 @@ then the result was divided by this number.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness}{\code{centralization_betweenness()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness}{\code{centralization_betweenness}}
 }
 
 \examples{
diff --git a/man/centr_betw_tmax.Rd b/man/centr_betw_tmax.Rd
index 8f2d8055209..cc3a620b28a 100644
--- a/man/centr_betw_tmax.Rd
+++ b/man/centr_betw_tmax.Rd
@@ -26,7 +26,7 @@ parameters.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax}}
 }
 
 \examples{
diff --git a/man/centr_clo.Rd b/man/centr_clo.Rd
index 1e198a7f658..2f2451ff4d8 100644
--- a/man/centr_clo.Rd
+++ b/man/centr_clo.Rd
@@ -37,7 +37,7 @@ then the result was divided by this number.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness}}
 }
 
 \examples{
diff --git a/man/centr_clo_tmax.Rd b/man/centr_clo_tmax.Rd
index cb24ce8cb25..3bada82c0e1 100644
--- a/man/centr_clo_tmax.Rd
+++ b/man/centr_clo_tmax.Rd
@@ -25,7 +25,7 @@ parameters.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax}}
 }
 
 \examples{
diff --git a/man/centr_degree.Rd b/man/centr_degree.Rd
index e8d24cc836a..2bad26581d2 100644
--- a/man/centr_degree.Rd
+++ b/man/centr_degree.Rd
@@ -45,7 +45,7 @@ then the result was divided by this number.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree}}
 }
 
 \examples{
diff --git a/man/centr_degree_tmax.Rd b/man/centr_degree_tmax.Rd
index 39ad9b598e8..9854dc94250 100644
--- a/man/centr_degree_tmax.Rd
+++ b/man/centr_degree_tmax.Rd
@@ -30,7 +30,7 @@ centrality score for graphs with given order and other parameters.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree_tmax}{\code{centralization_degree_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree_tmax}{\code{centralization_degree_tmax}}
 }
 
 \examples{
diff --git a/man/centr_eigen.Rd b/man/centr_eigen.Rd
index b0e78600678..aa2190e8c72 100644
--- a/man/centr_eigen.Rd
+++ b/man/centr_eigen.Rd
@@ -52,7 +52,7 @@ for a graph with the same number of vertices.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality}}
 }
 
 \examples{
diff --git a/man/centr_eigen_tmax.Rd b/man/centr_eigen_tmax.Rd
index f38305ad79c..280965d6e34 100644
--- a/man/centr_eigen_tmax.Rd
+++ b/man/centr_eigen_tmax.Rd
@@ -33,7 +33,7 @@ other parameters.
 See \code{\link[=centralize]{centralize()}} for a summary of graph centralization.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax}}
 }
 
 \examples{
diff --git a/man/centralization.betweenness.Rd b/man/centralization.betweenness.Rd
index 1a0b36856d5..08ca19bc030 100644
--- a/man/centralization.betweenness.Rd
+++ b/man/centralization.betweenness.Rd
@@ -22,7 +22,7 @@ centrality score by dividing by the theoretical maximum.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness}{\code{centralization_betweenness()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness}{\code{centralization_betweenness}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.betweenness.tmax.Rd b/man/centralization.betweenness.tmax.Rd
index 23d77bc600b..0437b2a04f4 100644
--- a/man/centralization.betweenness.tmax.Rd
+++ b/man/centralization.betweenness.tmax.Rd
@@ -24,7 +24,7 @@ given.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_betweenness_tmax}{\code{centralization_betweenness_tmax}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.closeness.Rd b/man/centralization.closeness.Rd
index 2a58c7164cf..99425241823 100644
--- a/man/centralization.closeness.Rd
+++ b/man/centralization.closeness.Rd
@@ -26,7 +26,7 @@ centrality score by dividing by the theoretical maximum.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness}{\code{centralization_closeness}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.closeness.tmax.Rd b/man/centralization.closeness.tmax.Rd
index e1560171fcd..296997b8577 100644
--- a/man/centralization.closeness.tmax.Rd
+++ b/man/centralization.closeness.tmax.Rd
@@ -27,7 +27,7 @@ given.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_closeness_tmax}{\code{centralization_closeness_tmax}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.degree.Rd b/man/centralization.degree.Rd
index fcc7c29d4ea..d79ad2782bf 100644
--- a/man/centralization.degree.Rd
+++ b/man/centralization.degree.Rd
@@ -30,7 +30,7 @@ centrality score by dividing by the theoretical maximum.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree}{\code{centralization_degree}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.degree.tmax.Rd b/man/centralization.degree.tmax.Rd
index a8ee59e781f..fb37be4c389 100644
--- a/man/centralization.degree.tmax.Rd
+++ b/man/centralization.degree.tmax.Rd
@@ -29,7 +29,7 @@ calculating the degree.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree_tmax}{\code{centralization_degree_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_degree_tmax}{\code{centralization_degree_tmax}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.evcent.Rd b/man/centralization.evcent.Rd
index 1592b68d728..6232a82e478 100644
--- a/man/centralization.evcent.Rd
+++ b/man/centralization.evcent.Rd
@@ -34,7 +34,7 @@ centrality score by dividing by the theoretical maximum.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality}{\code{centralization_eigenvector_centrality}}
 }
 
 \keyword{internal}
diff --git a/man/centralization.evcent.tmax.Rd b/man/centralization.evcent.tmax.Rd
index 941bf2f1c47..58f42161fde 100644
--- a/man/centralization.evcent.tmax.Rd
+++ b/man/centralization.evcent.tmax.Rd
@@ -31,7 +31,7 @@ eigenvector centralization requires normalized eigenvector centrality scores.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization_eigenvector_centrality_tmax}{\code{centralization_eigenvector_centrality_tmax}}
 }
 
 \keyword{internal}
diff --git a/man/centralize.Rd b/man/centralize.Rd
index 52be480fc97..7371107c8ad 100644
--- a/man/centralize.Rd
+++ b/man/centralize.Rd
@@ -48,7 +48,7 @@ with a single edge (and potentially many isolates).
 a graph-level score from vertex-level scores.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization}{\code{centralization()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization}{\code{centralization}}
 }
 
 \examples{
diff --git a/man/centralize.scores.Rd b/man/centralize.scores.Rd
index c8beb7003bb..5d2e9a16770 100644
--- a/man/centralize.scores.Rd
+++ b/man/centralize.scores.Rd
@@ -24,7 +24,7 @@ centrality score by dividing by the supplied theoretical maximum.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization}{\code{centralization()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_centralization}{\code{centralization}}
 }
 
 \keyword{internal}
diff --git a/man/cited.type.game.Rd b/man/cited.type.game.Rd
index 4ab76a878f8..a6200381f79 100644
--- a/man/cited.type.game.Rd
+++ b/man/cited.type.game.Rd
@@ -37,7 +37,7 @@ graph as a vertex attribute called \sQuote{\code{type}}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_cited_type_game}{\code{cited_type_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_cited_type_game}{\code{cited_type_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/citing.cited.type.game.Rd b/man/citing.cited.type.game.Rd
index 91e4aab00cc..0831fcf0c56 100644
--- a/man/citing.cited.type.game.Rd
+++ b/man/citing.cited.type.game.Rd
@@ -37,7 +37,7 @@ graph as a vertex attribute called \sQuote{\code{type}}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_citing_cited_type_game}{\code{citing_cited_type_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_citing_cited_type_game}{\code{citing_cited_type_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/clique.number.Rd b/man/clique.number.Rd
index 2a3cc5941cb..f174f244655 100644
--- a/man/clique.number.Rd
+++ b/man/clique.number.Rd
@@ -16,7 +16,7 @@ clique.number(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_number}{\code{clique_number()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_number}{\code{clique_number}}
 }
 
 \keyword{internal}
diff --git a/man/cliques.Rd b/man/cliques.Rd
index 28ee81ec917..21d60695054 100644
--- a/man/cliques.Rd
+++ b/man/cliques.Rd
@@ -138,7 +138,7 @@ of clique sizes, between the given minimum and maximum clique size.
 \code{is_clique()} tests whether all pairs within a vertex set are connected.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_cliques}{\code{cliques()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_number}{\code{clique_number()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{largest_weighted_cliques()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_weighted_clique_number}{\code{weighted_clique_number()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_size_hist}{\code{clique_size_hist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{maximal_cliques_hist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_clique}{\code{is_clique()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_cliques}{\code{cliques}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_number}{\code{clique_number}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_weighted_cliques}{\code{largest_weighted_cliques}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_weighted_clique_number}{\code{weighted_clique_number}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_clique_size_hist}{\code{clique_size_hist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_cliques_hist}{\code{maximal_cliques_hist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_clique}{\code{is_clique}}
 }
 
 \examples{
diff --git a/man/closeness.Rd b/man/closeness.Rd
index 3e994bbc83a..28e605155f7 100644
--- a/man/closeness.Rd
+++ b/man/closeness.Rd
@@ -67,7 +67,7 @@ graphs, consider using the harmonic centrality with
 \code{\link[=harmonic_centrality]{harmonic_centrality()}}
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_closeness_cutoff}{\code{closeness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_closeness_cutoff}{\code{closeness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster.distribution.Rd b/man/cluster.distribution.Rd
index ff4aea99839..f64f2450813 100644
--- a/man/cluster.distribution.Rd
+++ b/man/cluster.distribution.Rd
@@ -25,7 +25,7 @@ by the cluster sizes.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/cluster_edge_betweenness.Rd b/man/cluster_edge_betweenness.Rd
index 3581a2eee5b..8c34663fa3f 100644
--- a/man/cluster_edge_betweenness.Rd
+++ b/man/cluster_edge_betweenness.Rd
@@ -83,7 +83,7 @@ the betweenness of each of these at the time of their removal; and
 \code{bridges} contains the IDs of edges whose removal caused a split.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_fast_greedy.Rd b/man/cluster_fast_greedy.Rd
index 0c0ff840a9b..2d8aad6474f 100644
--- a/man/cluster_fast_greedy.Rd
+++ b/man/cluster_fast_greedy.Rd
@@ -48,7 +48,7 @@ community structure in very large networks,
 http://www.arxiv.org/abs/cond-mat/0408187 for the details.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_fluid_communities.Rd b/man/cluster_fluid_communities.Rd
index 3b90fdbc461..47fe0c42357 100644
--- a/man/cluster_fluid_communities.Rd
+++ b/man/cluster_fluid_communities.Rd
@@ -25,7 +25,7 @@ several fluids interacting in a non-homogeneous environment
 interaction and density.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_fluid_communities}{\code{community_fluid_communities()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_fluid_communities}{\code{community_fluid_communities}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/cluster_infomap.Rd b/man/cluster_infomap.Rd
index 37dd8e15e7e..51fcaaff782 100644
--- a/man/cluster_infomap.Rd
+++ b/man/cluster_infomap.Rd
@@ -47,7 +47,7 @@ be taken into account.
 Please see the details of this method in the references given below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_infomap}{\code{community_infomap()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_infomap}{\code{community_infomap}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_label_prop.Rd b/man/cluster_label_prop.Rd
index 8fde5915d2d..fb8f8fa7d69 100644
--- a/man/cluster_label_prop.Rd
+++ b/man/cluster_label_prop.Rd
@@ -69,7 +69,7 @@ connected groups of nodes form a consensus on a unique label to form
 communities.}
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_label_propagation}{\code{community_label_propagation()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_label_propagation}{\code{community_label_propagation}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_leading_eigen.Rd b/man/cluster_leading_eigen.Rd
index 128c032acb1..a7108b5b2a5 100644
--- a/man/cluster_leading_eigen.Rd
+++ b/man/cluster_leading_eigen.Rd
@@ -124,7 +124,7 @@ is non-zero, then the clustering is terminated.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_leiden.Rd b/man/cluster_leiden.Rd
index 041b65378ce..8400bca06b1 100644
--- a/man/cluster_leiden.Rd
+++ b/man/cluster_leiden.Rd
@@ -106,7 +106,7 @@ specify any \code{vertex_weights}, the correct vertex weights and scaling of
 \code{objective_function} argument.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_leiden}{\code{community_leiden()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_leiden}{\code{community_leiden}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_louvain.Rd b/man/cluster_louvain.Rd
index 5e4d0bf7149..c62b22b9228 100644
--- a/man/cluster_louvain.Rd
+++ b/man/cluster_louvain.Rd
@@ -51,7 +51,7 @@ vertices are processed in a random order.
 This function was contributed by Tom Gregorovic.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_multilevel}{\code{community_multilevel()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_multilevel}{\code{community_multilevel}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_optimal.Rd b/man/cluster_optimal.Rd
index 18cc85768ed..7a19e799305 100644
--- a/man/cluster_optimal.Rd
+++ b/man/cluster_optimal.Rd
@@ -63,7 +63,7 @@ print(modularity(fc))
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_optimal_modularity}{\code{community_optimal_modularity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_optimal_modularity}{\code{community_optimal_modularity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \references{
diff --git a/man/cluster_spinglass.Rd b/man/cluster_spinglass.Rd
index 89943f55726..2b65938686b 100644
--- a/man/cluster_spinglass.Rd
+++ b/man/cluster_spinglass.Rd
@@ -133,7 +133,7 @@ must be a vertex id, and the same energy function is used to find the
 community of the the given vertex. See also the examples below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/cluster_walktrap.Rd b/man/cluster_walktrap.Rd
index 8cdc835f429..336f544d0da 100644
--- a/man/cluster_walktrap.Rd
+++ b/man/cluster_walktrap.Rd
@@ -53,7 +53,7 @@ algorithm, see Pascal Pons, Matthieu Latapy: Computing communities in large
 networks using random walks, https://arxiv.org/abs/physics/0512106
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/clusters.Rd b/man/clusters.Rd
index 554aa0f266a..4ce5efe0a5c 100644
--- a/man/clusters.Rd
+++ b/man/clusters.Rd
@@ -20,7 +20,7 @@ connected components to search. It is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/cocitation.Rd b/man/cocitation.Rd
index e255875a6de..8e907d88495 100644
--- a/man/cocitation.Rd
+++ b/man/cocitation.Rd
@@ -39,7 +39,7 @@ costs the same amount of computation as for all vertices. This might change
 in the future.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_cocitation}{\code{cocitation()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_bibcoupling}{\code{bibcoupling()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_cocitation}{\code{cocitation}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_bibcoupling}{\code{bibcoupling}}
 }
 
 \examples{
diff --git a/man/cohesive.blocks.Rd b/man/cohesive.blocks.Rd
index dc63ae7a51f..41534393e7f 100644
--- a/man/cohesive.blocks.Rd
+++ b/man/cohesive.blocks.Rd
@@ -26,7 +26,7 @@ cohesive blocks.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesive_blocks}{\code{cohesive_blocks()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesive_blocks}{\code{cohesive_blocks}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/cohesive_blocks.Rd b/man/cohesive_blocks.Rd
index a0055aa0f47..c5d8bb58456 100644
--- a/man/cohesive_blocks.Rd
+++ b/man/cohesive_blocks.Rd
@@ -227,7 +227,7 @@ The generic function \code{\link[=plot]{plot()}} plots the graph, showing one or
 cohesive blocks in it.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesive_blocks}{\code{cohesive_blocks()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesive_blocks}{\code{cohesive_blocks}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}
 }
 
 \examples{
diff --git a/man/communities.Rd b/man/communities.Rd
index 75ea6b14a9e..35c6804dee8 100644
--- a/man/communities.Rd
+++ b/man/communities.Rd
@@ -239,7 +239,7 @@ corresponding to the communities. It passes additional arguments to
 \link{igraph.plotting} on how to change the plot.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/compare.Rd b/man/compare.Rd
index 1cb301f44ce..6abdb24fc47 100644
--- a/man/compare.Rd
+++ b/man/compare.Rd
@@ -37,7 +37,7 @@ A real number.
 This function assesses the distance between two community structures.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_compare_communities}{\code{compare_communities()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_compare_communities}{\code{compare_communities}}
 }
 
 \examples{
diff --git a/man/complementer.Rd b/man/complementer.Rd
index d3505eb5cb7..cc62671dca1 100644
--- a/man/complementer.Rd
+++ b/man/complementer.Rd
@@ -27,7 +27,7 @@ new graph.
 attributes are lost.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_complementer}{\code{complementer()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_complementer}{\code{complementer}}
 }
 
 \examples{
diff --git a/man/component_wise.Rd b/man/component_wise.Rd
index 58e6296ff63..ef95e742299 100644
--- a/man/component_wise.Rd
+++ b/man/component_wise.Rd
@@ -16,7 +16,7 @@ to calculate the layout separately for each component
 of the graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/components.Rd b/man/components.Rd
index 4c5d8284819..0e4ea0b16fa 100644
--- a/man/components.Rd
+++ b/man/components.Rd
@@ -85,7 +85,7 @@ The strongly connected components are implemented by two consecutive
 depth-first searches.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_connected}{\code{is_connected()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_connected_components}{\code{connected_components}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_connected}{\code{is_connected}}
 }
 
 \examples{
diff --git a/man/compose.Rd b/man/compose.Rd
index 10284f7b8be..ec25e6418e6 100644
--- a/man/compose.Rd
+++ b/man/compose.Rd
@@ -62,7 +62,7 @@ g1 and g2, respectively, then (a,a) is included in the result. See
 \code{\link[=simplify]{simplify()}} if you want to get rid of the self-loops.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/connect.neighborhood.Rd b/man/connect.neighborhood.Rd
index bb5a6af8fe5..4b9b08e4a34 100644
--- a/man/connect.neighborhood.Rd
+++ b/man/connect.neighborhood.Rd
@@ -27,7 +27,7 @@ argument is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_connect_neighborhood}{\code{connect_neighborhood()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_connect_neighborhood}{\code{connect_neighborhood}}
 }
 
 \keyword{internal}
diff --git a/man/consensus_tree.Rd b/man/consensus_tree.Rd
index 6e6c69a3061..b7b953c96dd 100644
--- a/man/consensus_tree.Rd
+++ b/man/consensus_tree.Rd
@@ -47,7 +47,7 @@ sampling from the given HRG. Otherwise it optimizes the HRG log-likelihood
 first, and then samples starting from the optimum.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus}}
 }
 
 \seealso{
diff --git a/man/constraint.Rd b/man/constraint.Rd
index d84760ebbfc..99aec867472 100644
--- a/man/constraint.Rd
+++ b/man/constraint.Rd
@@ -42,7 +42,7 @@ proportional tie strengths are defined as
 graph adjacency matrix. For isolated vertices, constraint is undefined.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_constraint}{\code{constraint()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_constraint}{\code{constraint}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/contract.Rd b/man/contract.Rd
index 3186df65e69..ae1856348aa 100644
--- a/man/contract.Rd
+++ b/man/contract.Rd
@@ -29,7 +29,7 @@ unchanged, vertex attributes are combined, according to the
 \code{vertex.attr.comb} parameter.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices}}
 }
 
 \examples{
diff --git a/man/contract.vertices.Rd b/man/contract.vertices.Rd
index 14d99eea049..9faaffddc6a 100644
--- a/man/contract.vertices.Rd
+++ b/man/contract.vertices.Rd
@@ -27,7 +27,7 @@ the new graph. Please see \code{\link[=attribute.combination]{attribute.combinat
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_contract_vertices}{\code{contract_vertices}}
 }
 
 \keyword{internal}
diff --git a/man/convex.hull.Rd b/man/convex.hull.Rd
index 24d33b9f750..fb16532e523 100644
--- a/man/convex.hull.Rd
+++ b/man/convex.hull.Rd
@@ -16,7 +16,7 @@ convex.hull(data)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d}}
 }
 
 \keyword{internal}
diff --git a/man/convex_hull.Rd b/man/convex_hull.Rd
index 6e05558398b..af0ff844407 100644
--- a/man/convex_hull.Rd
+++ b/man/convex_hull.Rd
@@ -25,7 +25,7 @@ Calculate the convex hull of a set of points, i.e. the covering polygon that
 has the smallest area.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d}}
 }
 
 \examples{
diff --git a/man/coreness.Rd b/man/coreness.Rd
index 665df6f55c4..2d820877595 100644
--- a/man/coreness.Rd
+++ b/man/coreness.Rd
@@ -31,7 +31,7 @@ subgraph of the k-core.
 This function calculates the coreness for each vertex.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_coreness}{\code{coreness()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_coreness}{\code{coreness}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/count.multiple.Rd b/man/count.multiple.Rd
index 0f20b5b8750..97d2ac1ff19 100644
--- a/man/count.multiple.Rd
+++ b/man/count.multiple.Rd
@@ -19,7 +19,7 @@ all edges in the graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/count_automorphisms.Rd b/man/count_automorphisms.Rd
index 4aa64bd0622..a72cea3058f 100644
--- a/man/count_automorphisms.Rd
+++ b/man/count_automorphisms.Rd
@@ -76,7 +76,7 @@ automorphisms themselves, use \code{\link[=automorphism_group]{automorphism_grou
 a compact representation of the automorphism group.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/count_isomorphisms.Rd b/man/count_isomorphisms.Rd
index c0d27ec0fe9..69722eb82e7 100644
--- a/man/count_isomorphisms.Rd
+++ b/man/count_isomorphisms.Rd
@@ -24,7 +24,7 @@ Number of isomorphic mappings between the two graphs.
 Count the number of isomorphic mappings between two graphs
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_isomorphisms_vf2}{\code{count_isomorphisms_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_isomorphisms_vf2}{\code{count_isomorphisms_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/count_motifs.Rd b/man/count_motifs.Rd
index bf4af497dbd..49c2d26a310 100644
--- a/man/count_motifs.Rd
+++ b/man/count_motifs.Rd
@@ -28,7 +28,7 @@ structure.  These functions search a graph for various motifs.
 size in graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_no}{\code{motifs_randesu_no()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_no}{\code{motifs_randesu_no}}
 }
 
 \examples{
diff --git a/man/count_reachable.Rd b/man/count_reachable.Rd
index 57bcce0078a..6f4cb81e917 100644
--- a/man/count_reachable.Rd
+++ b/man/count_reachable.Rd
@@ -35,7 +35,7 @@ For undirected graphs, two vertices are reachable from each other if they
 are in the same connected component.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_reachable}{\code{count_reachable()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_reachable}{\code{count_reachable}}
 }
 
 \examples{
diff --git a/man/count_subgraph_isomorphisms.Rd b/man/count_subgraph_isomorphisms.Rd
index 20b073ef8c7..83bdeb45273 100644
--- a/man/count_subgraph_isomorphisms.Rd
+++ b/man/count_subgraph_isomorphisms.Rd
@@ -72,7 +72,7 @@ If you want to ignore these attributes, then supply \code{NULL} for both of thes
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_subisomorphisms_vf2}{\code{count_subisomorphisms_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_subisomorphisms_vf2}{\code{count_subisomorphisms_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \references{
diff --git a/man/count_triangles.Rd b/man/count_triangles.Rd
index cc378288cea..cb391506d1e 100644
--- a/man/count_triangles.Rd
+++ b/man/count_triangles.Rd
@@ -36,7 +36,7 @@ to the first triangle, etc.
 \code{count_triangles()} counts how many triangles a vertex is part of.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_list_triangles}{\code{list_triangles()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_count_adjacent_triangles}{\code{count_adjacent_triangles()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_list_triangles}{\code{list_triangles}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_count_adjacent_triangles}{\code{count_adjacent_triangles}}
 }
 
 \examples{
diff --git a/man/curve_multiple.Rd b/man/curve_multiple.Rd
index 851137a1d34..627f03f7e51 100644
--- a/man/curve_multiple.Rd
+++ b/man/curve_multiple.Rd
@@ -26,7 +26,7 @@ are visible.
 plotting a graph with multiple edges, so that all edges are visible.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/decompose.Rd b/man/decompose.Rd
index 6fd46bbe4da..87c6ea71cfc 100644
--- a/man/decompose.Rd
+++ b/man/decompose.Rd
@@ -30,7 +30,7 @@ A list of graph objects.
 Creates a separate graph for each connected component of a graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose}}
 }
 
 \examples{
diff --git a/man/decompose.graph.Rd b/man/decompose.graph.Rd
index 2065be1e2c1..7702d5a5173 100644
--- a/man/decompose.graph.Rd
+++ b/man/decompose.graph.Rd
@@ -35,7 +35,7 @@ isolate vertices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose}}
 }
 
 \keyword{internal}
diff --git a/man/degree.Rd b/man/degree.Rd
index dc40c4696c0..3098ab10660 100644
--- a/man/degree.Rd
+++ b/man/degree.Rd
@@ -68,7 +68,7 @@ The degree of a vertex is its most basic structural property, the number of
 its adjacent edges.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maxdegree}{\code{maxdegree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_mean_degree}{\code{mean_degree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maxdegree}{\code{maxdegree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_mean_degree}{\code{mean_degree}}
 }
 
 \examples{
diff --git a/man/degree.distribution.Rd b/man/degree.distribution.Rd
index 69d71e21734..a822ad91728 100644
--- a/man/degree.distribution.Rd
+++ b/man/degree.distribution.Rd
@@ -21,7 +21,7 @@ be calculated.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/degree.sequence.game.Rd b/man/degree.sequence.game.Rd
index f4ddb22e73f..1b4f97d9d48 100644
--- a/man/degree.sequence.game.Rd
+++ b/man/degree.sequence.game.Rd
@@ -28,7 +28,7 @@ should be even. For directed graphs its sum should be the same as the sum of
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_degree_sequence_game}{\code{degree_sequence_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_degree_sequence_game}{\code{degree_sequence_game}}
 }
 
 \keyword{internal}
diff --git a/man/delete.edges.Rd b/man/delete.edges.Rd
index 3c0a70138f7..e05943e5676 100644
--- a/man/delete.edges.Rd
+++ b/man/delete.edges.Rd
@@ -21,7 +21,7 @@ containing the IDs or names of the source and target vertices, separated by
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_edges}{\code{delete_edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_edges}{\code{delete_edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/delete.vertices.Rd b/man/delete.vertices.Rd
index a956f6e4657..d35f2a0ddfc 100644
--- a/man/delete.vertices.Rd
+++ b/man/delete.vertices.Rd
@@ -18,7 +18,7 @@ delete.vertices(graph, v)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_vertices}{\code{delete_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_vertices}{\code{delete_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/delete_edges.Rd b/man/delete_edges.Rd
index 7aabfab9e3a..1d685a8b1da 100644
--- a/man/delete_edges.Rd
+++ b/man/delete_edges.Rd
@@ -21,7 +21,7 @@ The graph, with the edges removed.
 Delete edges from a graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_edges}{\code{delete_edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_edges}{\code{delete_edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/delete_vertices.Rd b/man/delete_vertices.Rd
index 1f206b2983a..2e83c0c0ba3 100644
--- a/man/delete_vertices.Rd
+++ b/man/delete_vertices.Rd
@@ -18,7 +18,7 @@ The graph, with the vertices removed.
 Delete vertices from a graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_vertices}{\code{delete_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_delete_vertices}{\code{delete_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/dfs.Rd b/man/dfs.Rd
index ea6f20e7f09..ecd57c303b1 100644
--- a/man/dfs.Rd
+++ b/man/dfs.Rd
@@ -119,7 +119,7 @@ The extra argument.
 to terminate it. See examples below on how to use the callback functions.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/diameter.Rd b/man/diameter.Rd
index c961c954447..ba86e673d93 100644
--- a/man/diameter.Rd
+++ b/man/diameter.Rd
@@ -55,7 +55,7 @@ one found.
 connected by the diameter path.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/difference.igraph.Rd b/man/difference.igraph.Rd
index 03938205175..1996af8173d 100644
--- a/man/difference.igraph.Rd
+++ b/man/difference.igraph.Rd
@@ -44,7 +44,7 @@ Note that \code{big} and \code{small} must both be directed or both be
 undirected, otherwise an error message is given.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_difference}{\code{difference()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_difference}{\code{difference}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}
 }
 
 \examples{
diff --git a/man/dim_select.Rd b/man/dim_select.Rd
index 60802350d57..939f793f9ba 100644
--- a/man/dim_select.Rd
+++ b/man/dim_select.Rd
@@ -34,7 +34,7 @@ distributions, with different means, and we want to know their border. See
 examples below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_dim_select}{\code{dim_select()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_dim_select}{\code{dim_select}}
 }
 
 \examples{
diff --git a/man/disjoint_union.Rd b/man/disjoint_union.Rd
index 87b27fb98d0..4836b744843 100644
--- a/man/disjoint_union.Rd
+++ b/man/disjoint_union.Rd
@@ -43,7 +43,7 @@ An error is generated if some input graphs are directed and others are
 undirected.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/distances.Rd b/man/distances.Rd
index c22255564db..d1b3c793460 100644
--- a/man/distances.Rd
+++ b/man/distances.Rd
@@ -248,7 +248,7 @@ directions are considered, so every pair of vertices appears twice in the
 histogram.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths}{\code{get_all_shortest_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths_dijkstra}{\code{get_all_shortest_paths_dijkstra()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_path_length_dijkstra}{\code{average_path_length_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths}{\code{get_all_shortest_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths_dijkstra}{\code{get_all_shortest_paths_dijkstra}}
 }
 
 \examples{
diff --git a/man/diversity.Rd b/man/diversity.Rd
index 8d2a72d33fa..aaa8363446b 100644
--- a/man/diversity.Rd
+++ b/man/diversity.Rd
@@ -36,7 +36,7 @@ sum(w[i,l], l=1..k[i]),} and \eqn{k_i}{k[i]} is the (total) degree of vertex
 For vertices with degree less than two the function returns \code{NaN}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_diversity}{\code{diversity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_diversity}{\code{diversity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/dominator.tree.Rd b/man/dominator.tree.Rd
index a60f1945c4e..afafc01e63c 100644
--- a/man/dominator.tree.Rd
+++ b/man/dominator.tree.Rd
@@ -25,7 +25,7 @@ the original one in the input graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_dominator_tree}{\code{dominator_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_dominator_tree}{\code{dominator_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/dominator_tree.Rd b/man/dominator_tree.Rd
index afd20cb92fb..2fd7bd2ecd8 100644
--- a/man/dominator_tree.Rd
+++ b/man/dominator_tree.Rd
@@ -56,7 +56,7 @@ This function implements the Lengauer-Tarjan algorithm to construct the
 dominator tree of a directed graph. For details see the reference below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_dominator_tree}{\code{dominator_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_dominator_tree}{\code{dominator_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/dot-apply_modifiers.Rd b/man/dot-apply_modifiers.Rd
index 07c64014394..33317931c85 100644
--- a/man/dot-apply_modifiers.Rd
+++ b/man/dot-apply_modifiers.Rd
@@ -19,7 +19,7 @@ This is a helper function for the common parts of \code{make_()} and
 \code{sample_()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/dyad.census.Rd b/man/dyad.census.Rd
index a176ca42486..1be3e724b7d 100644
--- a/man/dyad.census.Rd
+++ b/man/dyad.census.Rd
@@ -16,7 +16,7 @@ dyad.census(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}
 }
 
 \keyword{internal}
diff --git a/man/dyad_census.Rd b/man/dyad_census.Rd
index ae76d40ea5c..f6641612894 100644
--- a/man/dyad_census.Rd
+++ b/man/dyad_census.Rd
@@ -29,7 +29,7 @@ vertices is measured. It can be in three states: mutual, asymmetric or
 non-existent.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_dyad_census}{\code{dyad_census}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}
 }
 
 \examples{
diff --git a/man/eccentricity.Rd b/man/eccentricity.Rd
index 245971a6bfe..387c9950ccb 100644
--- a/man/eccentricity.Rd
+++ b/man/eccentricity.Rd
@@ -49,7 +49,7 @@ This implementation ignores vertex pairs that are in different components.
 Isolate vertices have eccentricity zero.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{eccentricity_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eccentricity_dijkstra}{\code{eccentricity_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/edge.betweenness.Rd b/man/edge.betweenness.Rd
index 7084de3a29f..c99e16eb871 100644
--- a/man/edge.betweenness.Rd
+++ b/man/edge.betweenness.Rd
@@ -35,7 +35,7 @@ betweenness. If negative, then there is no such limit.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/edge.betweenness.community.Rd b/man/edge.betweenness.community.Rd
index 5cc2d41f5f1..fb773b18838 100644
--- a/man/edge.betweenness.community.Rd
+++ b/man/edge.betweenness.community.Rd
@@ -63,7 +63,7 @@ vector corresponding to the highest possible modularity score.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/edge.connectivity.Rd b/man/edge.connectivity.Rd
index 398f50b98c9..124abb22c47 100644
--- a/man/edge.connectivity.Rd
+++ b/man/edge.connectivity.Rd
@@ -30,7 +30,7 @@ thanks Peter.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/edge.disjoint.paths.Rd b/man/edge.disjoint.paths.Rd
index b8a84f74cc6..27ec7c6c540 100644
--- a/man/edge.disjoint.paths.Rd
+++ b/man/edge.disjoint.paths.Rd
@@ -30,7 +30,7 @@ thanks Peter.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/edge_attr.Rd b/man/edge_attr.Rd
index 23877ff660a..1bbc5b13cc9 100644
--- a/man/edge_attr.Rd
+++ b/man/edge_attr.Rd
@@ -24,7 +24,7 @@ edge attributes if \code{name} is missing.
 Query edge attributes of a graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/edge_connectivity.Rd b/man/edge_connectivity.Rd
index 2c920c2facc..9d95f5df505 100644
--- a/man/edge_connectivity.Rd
+++ b/man/edge_connectivity.Rd
@@ -82,7 +82,7 @@ included only for having more descriptive function names.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_disjoint_paths}{\code{edge_disjoint_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_adhesion}{\code{adhesion()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_edge_connectivity}{\code{st_edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_connectivity}{\code{edge_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_edge_disjoint_paths}{\code{edge_disjoint_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_adhesion}{\code{adhesion}}
 }
 
 \examples{
diff --git a/man/edge_density.Rd b/man/edge_density.Rd
index f0ff20a804d..36c061211ec 100644
--- a/man/edge_density.Rd
+++ b/man/edge_density.Rd
@@ -29,7 +29,7 @@ does not check whether the graph has multi-edges and will return meaningless
 results for such graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density}}
 }
 
 \examples{
diff --git a/man/ego.Rd b/man/ego.Rd
index e6903bbf88d..2ded03f3109 100644
--- a/man/ego.Rd
+++ b/man/ego.Rd
@@ -117,7 +117,7 @@ the vertex, edge and graph attributes.
 all other vertices in its neighborhood.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_connect_neighborhood}{\code{connect_neighborhood()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_connect_neighborhood}{\code{connect_neighborhood}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/eigen_centrality.Rd b/man/eigen_centrality.Rd
index 1f838d49edc..9e285fe2fab 100644
--- a/man/eigen_centrality.Rd
+++ b/man/eigen_centrality.Rd
@@ -97,7 +97,7 @@ From igraph version 0.5 this function uses ARPACK for the underlying
 computation, see \code{\link[=arpack]{arpack()}} for more about ARPACK in igraph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/embed_adjacency_matrix.Rd b/man/embed_adjacency_matrix.Rd
index e23aa38f717..40237355f45 100644
--- a/man/embed_adjacency_matrix.Rd
+++ b/man/embed_adjacency_matrix.Rd
@@ -89,7 +89,7 @@ sqrt(D[no])}. (For undirected graphs \eqn{U=V}, so it is enough to keep one
 of them.)
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{adjacency_spectral_embedding()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_adjacency_spectral_embedding}{\code{adjacency_spectral_embedding}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/embed_laplacian_matrix.Rd b/man/embed_laplacian_matrix.Rd
index 186b23d07c1..637fa920cd2 100644
--- a/man/embed_laplacian_matrix.Rd
+++ b/man/embed_laplacian_matrix.Rd
@@ -95,7 +95,7 @@ They are essentially doing the same as \code{\link[=embed_adjacency_matrix]{embe
 but work on the Laplacian matrix, instead of the adjacency matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{laplacian_spectral_embedding()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Embedding.html#igraph_laplacian_spectral_embedding}{\code{laplacian_spectral_embedding}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/ends.Rd b/man/ends.Rd
index 0387709896b..d3997fb71e9 100644
--- a/man/ends.Rd
+++ b/man/ends.Rd
@@ -22,7 +22,7 @@ A two column matrix of vertex names or vertex ids.
 Incident vertices of some graph edges
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/erdos.renyi.game.Rd b/man/erdos.renyi.game.Rd
index fc3f42efc98..018b1d078fb 100644
--- a/man/erdos.renyi.game.Rd
+++ b/man/erdos.renyi.game.Rd
@@ -41,7 +41,7 @@ Since igraph version 0.8.0, both \code{erdos.renyi.game()} and
 \code{random.graph.game()} is an (also deprecated) alias to this function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnp}{\code{erdos_renyi_game_gnp()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnm}{\code{erdos_renyi_game_gnm()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnp}{\code{erdos_renyi_game_gnp}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnm}{\code{erdos_renyi_game_gnm}}
 }
 
 \examples{
diff --git a/man/establishment.game.Rd b/man/establishment.game.Rd
index 35c226542df..6156c90d772 100644
--- a/man/establishment.game.Rd
+++ b/man/establishment.game.Rd
@@ -35,7 +35,7 @@ types. These should be probabilities, i.e. numbers between zero and one.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_establishment_game}{\code{establishment_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_establishment_game}{\code{establishment_game}}
 }
 
 \keyword{internal}
diff --git a/man/estimate_betweenness.Rd b/man/estimate_betweenness.Rd
index b56c96035f9..230c5a9972a 100644
--- a/man/estimate_betweenness.Rd
+++ b/man/estimate_betweenness.Rd
@@ -35,7 +35,7 @@ so they are interpreted as distances.}
 Use \code{\link[=betweenness]{betweenness()}} with the \code{cutoff} argument instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_betweenness_cutoff}{\code{betweenness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_betweenness_cutoff}{\code{betweenness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/estimate_closeness.Rd b/man/estimate_closeness.Rd
index 0b6fb83b1a4..0c35c428bbf 100644
--- a/man/estimate_closeness.Rd
+++ b/man/estimate_closeness.Rd
@@ -43,7 +43,7 @@ all reachable vertices.}
 Use \code{\link[=closeness]{closeness()}} with the \code{cutoff} argument instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_closeness_cutoff}{\code{closeness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_closeness_cutoff}{\code{closeness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/estimate_edge_betweenness.Rd b/man/estimate_edge_betweenness.Rd
index b5ebe0531dd..7461016981a 100644
--- a/man/estimate_edge_betweenness.Rd
+++ b/man/estimate_edge_betweenness.Rd
@@ -34,7 +34,7 @@ so they are interpreted as distances.}
 Use \code{\link[=edge_betweenness]{edge_betweenness()}} with the \code{cutoff} argument instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_edge_betweenness_cutoff}{\code{edge_betweenness_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/evcent.Rd b/man/evcent.Rd
index 838f58d6ca8..a6e0f6ed63a 100644
--- a/man/evcent.Rd
+++ b/man/evcent.Rd
@@ -43,7 +43,7 @@ weights spread the centrality better.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_eigenvector_centrality}{\code{eigenvector_centrality}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/exportPajek.Rd b/man/exportPajek.Rd
index ccb5ef9fb61..21f89720299 100644
--- a/man/exportPajek.Rd
+++ b/man/exportPajek.Rd
@@ -38,7 +38,7 @@ See details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/farthest.nodes.Rd b/man/farthest.nodes.Rd
index a9ce78a850c..87862471ed0 100644
--- a/man/farthest.nodes.Rd
+++ b/man/farthest.nodes.Rd
@@ -29,7 +29,7 @@ used by default.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/fastgreedy.community.Rd b/man/fastgreedy.community.Rd
index 957bf210ba7..0b374043f3f 100644
--- a/man/fastgreedy.community.Rd
+++ b/man/fastgreedy.community.Rd
@@ -40,7 +40,7 @@ edge weight means a stronger connection for this function.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/feedback_arc_set.Rd b/man/feedback_arc_set.Rd
index 9771c803583..d62f8170f6c 100644
--- a/man/feedback_arc_set.Rd
+++ b/man/feedback_arc_set.Rd
@@ -39,7 +39,7 @@ arc set ensures that the remaining graph is a forest (i.e. every connected
 component is a tree).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_feedback_arc_set}{\code{feedback_arc_set()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_feedback_arc_set}{\code{feedback_arc_set}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/feedback_vertex_set.Rd b/man/feedback_vertex_set.Rd
index 665554fc563..9d095a2b731 100644
--- a/man/feedback_vertex_set.Rd
+++ b/man/feedback_vertex_set.Rd
@@ -31,7 +31,7 @@ all cycles in the graph. Finding a \emph{minimum} feedback vertex set is an
 NP-complete problem, both on directed and undirected graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_feedback_vertex_set}{\code{feedback_vertex_set()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_feedback_vertex_set}{\code{feedback_vertex_set}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/find_cycle.Rd b/man/find_cycle.Rd
index bde1a9a54e3..7f795d0f4bd 100644
--- a/man/find_cycle.Rd
+++ b/man/find_cycle.Rd
@@ -29,7 +29,7 @@ Use \code{\link[=is_acyclic]{is_acyclic()}} to determine if a graph has cycles,
 a specific cycle.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_find_cycle}{\code{find_cycle()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_find_cycle}{\code{find_cycle}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/fit_hrg.Rd b/man/fit_hrg.Rd
index d2467ad4634..4ca8a935158 100644
--- a/man/fit_hrg.Rd
+++ b/man/fit_hrg.Rd
@@ -58,7 +58,7 @@ from a given HRG, if this is given in the \code{hrg()} argument and the
 \code{as.hclust()} provided in this package.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_fit}{\code{hrg_fit()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_fit}{\code{hrg_fit}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/forest.fire.game.Rd b/man/forest.fire.game.Rd
index 730a969ef54..5bc146fb7c6 100644
--- a/man/forest.fire.game.Rd
+++ b/man/forest.fire.game.Rd
@@ -25,7 +25,7 @@ probability is calculated as \code{bw.factor*fw.prob}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game}}
 }
 
 \keyword{internal}
diff --git a/man/from_incidence_matrix.Rd b/man/from_incidence_matrix.Rd
index 2f2294fc343..9ad245fb934 100644
--- a/man/from_incidence_matrix.Rd
+++ b/man/from_incidence_matrix.Rd
@@ -18,7 +18,7 @@ Some authors refer to the bipartite adjacency matrix as the
 this naming to avoid confusion with the edge-vertex incidence matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.adjacency.Rd b/man/get.adjacency.Rd
index fcab543222c..f9f122468a9 100644
--- a/man/get.adjacency.Rd
+++ b/man/get.adjacency.Rd
@@ -53,7 +53,7 @@ matrices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.adjedgelist.Rd b/man/get.adjedgelist.Rd
index c09b64002a1..88ff783d234 100644
--- a/man/get.adjedgelist.Rd
+++ b/man/get.adjedgelist.Rd
@@ -29,7 +29,7 @@ is not allowed for directed graphs and will be replaced with \code{"once"}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.adjlist.Rd b/man/get.adjlist.Rd
index e35c005240f..30fdcb535a7 100644
--- a/man/get.adjlist.Rd
+++ b/man/get.adjlist.Rd
@@ -33,7 +33,7 @@ of each set of parallel edges.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/get.all.shortest.paths.Rd b/man/get.all.shortest.paths.Rd
index 6805146d663..cf37658bbe3 100644
--- a/man/get.all.shortest.paths.Rd
+++ b/man/get.all.shortest.paths.Rd
@@ -44,7 +44,7 @@ of a path is the sum of the weights of its constituent edges.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths}{\code{get_all_shortest_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths_dijkstra}{\code{get_all_shortest_paths_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths}{\code{get_all_shortest_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_all_shortest_paths_dijkstra}{\code{get_all_shortest_paths_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.data.frame.Rd b/man/get.data.frame.Rd
index 39ab6b425b1..a3a6214fad7 100644
--- a/man/get.data.frame.Rd
+++ b/man/get.data.frame.Rd
@@ -19,7 +19,7 @@ edges, or both. The default is \sQuote{edges}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/get.diameter.Rd b/man/get.diameter.Rd
index 06560f3b4d6..b84cddc5874 100644
--- a/man/get.diameter.Rd
+++ b/man/get.diameter.Rd
@@ -29,7 +29,7 @@ used by default.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.edge.attribute.Rd b/man/get.edge.attribute.Rd
index 2a8249a075d..0cdfc8d758e 100644
--- a/man/get.edge.attribute.Rd
+++ b/man/get.edge.attribute.Rd
@@ -22,7 +22,7 @@ for a subset of edges.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.edge.ids.Rd b/man/get.edge.ids.Rd
index eaa81b44085..ad699c39ccc 100644
--- a/man/get.edge.ids.Rd
+++ b/man/get.edge.ids.Rd
@@ -30,7 +30,7 @@ returned for the non-existant edge(s).}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}
 }
 
 \keyword{internal}
diff --git a/man/get.edgelist.Rd b/man/get.edgelist.Rd
index dd2da5d61ac..b32c423f810 100644
--- a/man/get.edgelist.Rd
+++ b/man/get.edgelist.Rd
@@ -20,7 +20,7 @@ vertex ids.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/get.incidence.Rd b/man/get.incidence.Rd
index b4f40697fb6..8eefca9c436 100644
--- a/man/get.incidence.Rd
+++ b/man/get.incidence.Rd
@@ -36,7 +36,7 @@ created, you will need the \code{Matrix} package for this.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_get_biadjacency}{\code{get_biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.shortest.paths.Rd b/man/get.shortest.paths.Rd
index 606cb1d1c09..53405aa2907 100644
--- a/man/get.shortest.paths.Rd
+++ b/man/get.shortest.paths.Rd
@@ -80,7 +80,7 @@ used, regardless of this argument.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \keyword{internal}
diff --git a/man/get.stochastic.Rd b/man/get.stochastic.Rd
index df4c0d29b32..038573400d7 100644
--- a/man/get.stochastic.Rd
+++ b/man/get.stochastic.Rd
@@ -26,7 +26,7 @@ sum up to one; otherwise it is the columns.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic}{\code{get_stochastic()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic_sparse}{\code{get_stochastic_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic}{\code{get_stochastic}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic_sparse}{\code{get_stochastic_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/get.vertex.attribute.Rd b/man/get.vertex.attribute.Rd
index 77bad90850a..66146ded347 100644
--- a/man/get.vertex.attribute.Rd
+++ b/man/get.vertex.attribute.Rd
@@ -22,7 +22,7 @@ for these vertices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/get_edge_ids.Rd b/man/get_edge_ids.Rd
index 262d17f1bb9..a5e9731eea5 100644
--- a/man/get_edge_ids.Rd
+++ b/man/get_edge_ids.Rd
@@ -40,7 +40,7 @@ This function allows finding the edges of the graph, via their incident
 vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}
 }
 
 \examples{
diff --git a/man/girth.Rd b/man/girth.Rd
index aa27e8ebb6e..b3d346834db 100644
--- a/man/girth.Rd
+++ b/man/girth.Rd
@@ -37,7 +37,7 @@ symposium on Theory of computing}, 1-10, 1977. The first implementation of
 this function was done by Keith Briggs, thanks Keith.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/global_efficiency.Rd b/man/global_efficiency.Rd
index c3df23056cb..fb9347a856c 100644
--- a/man/global_efficiency.Rd
+++ b/man/global_efficiency.Rd
@@ -90,7 +90,7 @@ efficiency above.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_global_efficiency}{\code{global_efficiency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_efficiency}{\code{local_efficiency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_local_efficiency}{\code{average_local_efficiency()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_global_efficiency}{\code{global_efficiency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_efficiency}{\code{local_efficiency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_average_local_efficiency}{\code{average_local_efficiency}}
 }
 
 \examples{
diff --git a/man/gorder.Rd b/man/gorder.Rd
index 805034f3a1b..b1e6d7593bb 100644
--- a/man/gorder.Rd
+++ b/man/gorder.Rd
@@ -19,7 +19,7 @@ Number of vertices, numeric scalar.
 \code{vcount()} and \code{gorder()} are aliases.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/graph.Rd b/man/graph.Rd
index 9b48a955567..b3d2e2a0bd2 100644
--- a/man/graph.Rd
+++ b/man/graph.Rd
@@ -59,7 +59,7 @@ Do not give both of them.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.adhesion.Rd b/man/graph.adhesion.Rd
index b5ef47f9a7e..8a960f28ec4 100644
--- a/man/graph.adhesion.Rd
+++ b/man/graph.adhesion.Rd
@@ -24,7 +24,7 @@ thanks Peter.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_adhesion}{\code{adhesion()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_adhesion}{\code{adhesion}}
 }
 
 \keyword{internal}
diff --git a/man/graph.adjacency.Rd b/man/graph.adjacency.Rd
index 0c91cc2d348..e6fa3e3bcfa 100644
--- a/man/graph.adjacency.Rd
+++ b/man/graph.adjacency.Rd
@@ -55,7 +55,7 @@ former is ignored.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjacency}{\code{adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_weighted_adjacency}{\code{weighted_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjacency}{\code{adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_weighted_adjacency}{\code{weighted_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.adjlist.Rd b/man/graph.adjlist.Rd
index 8e2895891b2..f15986e4189 100644
--- a/man/graph.adjlist.Rd
+++ b/man/graph.adjlist.Rd
@@ -31,7 +31,7 @@ This argument is ignored if \code{mode} is \code{out} or \verb{in}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist}}
 }
 
 \keyword{internal}
diff --git a/man/graph.atlas.Rd b/man/graph.atlas.Rd
index 8d465cc1cad..98bf5f6772c 100644
--- a/man/graph.atlas.Rd
+++ b/man/graph.atlas.Rd
@@ -16,7 +16,7 @@ graph.atlas(n)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_atlas}{\code{atlas()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_atlas}{\code{atlas}}
 }
 
 \keyword{internal}
diff --git a/man/graph.automorphisms.Rd b/man/graph.automorphisms.Rd
index bf5a5676697..ebdb5772e47 100644
--- a/man/graph.automorphisms.Rd
+++ b/man/graph.automorphisms.Rd
@@ -44,7 +44,7 @@ first smallest maximally non-trivially connected non-singleton cell.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_count_automorphisms}{\code{count_automorphisms}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.bfs.Rd b/man/graph.bfs.Rd
index 97ee8580ca9..c63ff68520d 100644
--- a/man/graph.bfs.Rd
+++ b/man/graph.bfs.Rd
@@ -75,7 +75,7 @@ from igraph 1.3.0; use \code{mode} instead.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.bipartite.Rd b/man/graph.bipartite.Rd
index ce32bf3e77b..cb494e699d7 100644
--- a/man/graph.bipartite.Rd
+++ b/man/graph.bipartite.Rd
@@ -28,7 +28,7 @@ bipartite graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_create_bipartite}{\code{create_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_create_bipartite}{\code{create_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.complementer.Rd b/man/graph.complementer.Rd
index 50b1be3a6fd..d44b6cd0534 100644
--- a/man/graph.complementer.Rd
+++ b/man/graph.complementer.Rd
@@ -18,7 +18,7 @@ graph.complementer(graph, loops = FALSE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_complementer}{\code{complementer()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_complementer}{\code{complementer}}
 }
 
 \keyword{internal}
diff --git a/man/graph.compose.Rd b/man/graph.compose.Rd
index 8cd2dd7d4fe..1d912274b9f 100644
--- a/man/graph.compose.Rd
+++ b/man/graph.compose.Rd
@@ -24,7 +24,7 @@ but not both graphs are named.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.coreness.Rd b/man/graph.coreness.Rd
index 2c224282090..b79dc6cd4d1 100644
--- a/man/graph.coreness.Rd
+++ b/man/graph.coreness.Rd
@@ -21,7 +21,7 @@ argument is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_coreness}{\code{coreness()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_coreness}{\code{coreness}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.data.frame.Rd b/man/graph.data.frame.Rd
index 7b87f3a650a..d049e2b0156 100644
--- a/man/graph.data.frame.Rd
+++ b/man/graph.data.frame.Rd
@@ -25,7 +25,7 @@ with \code{as.data.frame}, if not \code{NULL}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.de.bruijn.Rd b/man/graph.de.bruijn.Rd
index 48f3160ed40..4028cca7f79 100644
--- a/man/graph.de.bruijn.Rd
+++ b/man/graph.de.bruijn.Rd
@@ -18,7 +18,7 @@ graph.de.bruijn(m, n)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_de_bruijn}{\code{de_bruijn()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_de_bruijn}{\code{de_bruijn}}
 }
 
 \keyword{internal}
diff --git a/man/graph.density.Rd b/man/graph.density.Rd
index 704159818f9..4bba0221a0a 100644
--- a/man/graph.density.Rd
+++ b/man/graph.density.Rd
@@ -21,7 +21,7 @@ the result will not be meaningful.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density}}
 }
 
 \keyword{internal}
diff --git a/man/graph.dfs.Rd b/man/graph.dfs.Rd
index 332e2674268..1be52dd5f07 100644
--- a/man/graph.dfs.Rd
+++ b/man/graph.dfs.Rd
@@ -67,7 +67,7 @@ algorithm. See details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.disjoint.union.Rd b/man/graph.disjoint.union.Rd
index 860eec15e51..334e22011a5 100644
--- a/man/graph.disjoint.union.Rd
+++ b/man/graph.disjoint.union.Rd
@@ -16,7 +16,7 @@ graph.disjoint.union(...)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.diversity.Rd b/man/graph.diversity.Rd
index db8b87a013b..357aad02218 100644
--- a/man/graph.diversity.Rd
+++ b/man/graph.diversity.Rd
@@ -22,7 +22,7 @@ that this measure is not defined for unweighted graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_diversity}{\code{diversity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_diversity}{\code{diversity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.edgelist.Rd b/man/graph.edgelist.Rd
index d1b9690ed6f..363b801a9db 100644
--- a/man/graph.edgelist.Rd
+++ b/man/graph.edgelist.Rd
@@ -18,7 +18,7 @@ graph.edgelist(el, directed = TRUE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}
 }
 
 \keyword{internal}
diff --git a/man/graph.empty.Rd b/man/graph.empty.Rd
index 651e243fd38..5ebf330c526 100644
--- a/man/graph.empty.Rd
+++ b/man/graph.empty.Rd
@@ -18,7 +18,7 @@ graph.empty(n = 0, directed = TRUE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}
 }
 
 \keyword{internal}
diff --git a/man/graph.extended.chordal.ring.Rd b/man/graph.extended.chordal.ring.Rd
index 6d1b0a83a04..14c2de1d743 100644
--- a/man/graph.extended.chordal.ring.Rd
+++ b/man/graph.extended.chordal.ring.Rd
@@ -21,7 +21,7 @@ details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_extended_chordal_ring}{\code{extended_chordal_ring()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_extended_chordal_ring}{\code{extended_chordal_ring}}
 }
 
 \keyword{internal}
diff --git a/man/graph.famous.Rd b/man/graph.famous.Rd
index 9469016b8e1..6606e3bd78f 100644
--- a/man/graph.famous.Rd
+++ b/man/graph.famous.Rd
@@ -59,7 +59,7 @@ Do not give both of them.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.formula.Rd b/man/graph.formula.Rd
index 024b15a5574..b73f9311b05 100644
--- a/man/graph.formula.Rd
+++ b/man/graph.formula.Rd
@@ -22,7 +22,7 @@ multiple edges are removed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}
 }
 
 \keyword{internal}
diff --git a/man/graph.full.Rd b/man/graph.full.Rd
index 078a76cdf0c..8f4c3759fb3 100644
--- a/man/graph.full.Rd
+++ b/man/graph.full.Rd
@@ -20,7 +20,7 @@ graph.full(n, directed = FALSE, loops = FALSE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full}{\code{full()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full}{\code{full}}
 }
 
 \keyword{internal}
diff --git a/man/graph.full.bipartite.Rd b/man/graph.full.bipartite.Rd
index 2bc9cd007f5..73c4c4e2899 100644
--- a/man/graph.full.bipartite.Rd
+++ b/man/graph.full.bipartite.Rd
@@ -26,7 +26,7 @@ ignored for undirected graphs.x}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_full_bipartite}{\code{full_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_full_bipartite}{\code{full_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.full.citation.Rd b/man/graph.full.citation.Rd
index 8f95b2d5c42..928facb2918 100644
--- a/man/graph.full.citation.Rd
+++ b/man/graph.full.citation.Rd
@@ -18,7 +18,7 @@ graph.full.citation(n, directed = TRUE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_citation}{\code{full_citation()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_citation}{\code{full_citation}}
 }
 
 \keyword{internal}
diff --git a/man/graph.graphdb.Rd b/man/graph.graphdb.Rd
index 7dc2debef6b..81581b9db30 100644
--- a/man/graph.graphdb.Rd
+++ b/man/graph.graphdb.Rd
@@ -54,7 +54,7 @@ suffix is added to the filename.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb}}
 }
 
 \keyword{internal}
diff --git a/man/graph.incidence.Rd b/man/graph.incidence.Rd
index 7f61c4c7d6c..b1ecefe9659 100644
--- a/man/graph.incidence.Rd
+++ b/man/graph.incidence.Rd
@@ -54,7 +54,7 @@ type) will be added.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.isocreate.Rd b/man/graph.isocreate.Rd
index 9b7f60d48e8..61d76eb88fc 100644
--- a/man/graph.isocreate.Rd
+++ b/man/graph.isocreate.Rd
@@ -20,7 +20,7 @@ graph.isocreate(size, number, directed = TRUE)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create}}
 }
 
 \keyword{internal}
diff --git a/man/graph.kautz.Rd b/man/graph.kautz.Rd
index 519ae844cce..1f5401cf383 100644
--- a/man/graph.kautz.Rd
+++ b/man/graph.kautz.Rd
@@ -18,7 +18,7 @@ graph.kautz(m, n)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kautz}{\code{kautz()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kautz}{\code{kautz}}
 }
 
 \keyword{internal}
diff --git a/man/graph.knn.Rd b/man/graph.knn.Rd
index 2b4a24c3631..9d524997029 100644
--- a/man/graph.knn.Rd
+++ b/man/graph.knn.Rd
@@ -43,7 +43,7 @@ Weights are are used to calculate a weighted degree (also called
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.laplacian.Rd b/man/graph.laplacian.Rd
index 933197d4e2c..483e40a6c4a 100644
--- a/man/graph.laplacian.Rd
+++ b/man/graph.laplacian.Rd
@@ -32,7 +32,7 @@ matrix. The \code{Matrix} package is required for sparse matrices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.lattice.Rd b/man/graph.lattice.Rd
index 790d06dbdc0..2b3666182f6 100644
--- a/man/graph.lattice.Rd
+++ b/man/graph.lattice.Rd
@@ -45,7 +45,7 @@ be extended to boolean vector with dimvector length.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice}}
 }
 
 \keyword{internal}
diff --git a/man/graph.lcf.Rd b/man/graph.lcf.Rd
index 009308639bc..804742c9c91 100644
--- a/man/graph.lcf.Rd
+++ b/man/graph.lcf.Rd
@@ -21,7 +21,7 @@ it is set to \code{len(shifts) * repeats}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector}}
 }
 
 \keyword{internal}
diff --git a/man/graph.maxflow.Rd b/man/graph.maxflow.Rd
index 76ad32907b7..2ccccf6acd5 100644
--- a/man/graph.maxflow.Rd
+++ b/man/graph.maxflow.Rd
@@ -24,7 +24,7 @@ Note that the \code{weight} edge attribute is not used by this function.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_maxflow}{\code{maxflow()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_maxflow}{\code{maxflow}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \keyword{internal}
diff --git a/man/graph.mincut.Rd b/man/graph.mincut.Rd
index dfe55e7f3da..13541439cbb 100644
--- a/man/graph.mincut.Rd
+++ b/man/graph.mincut.Rd
@@ -33,7 +33,7 @@ partitions are also returned.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut}{\code{mincut()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut_value}{\code{mincut_value()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut}{\code{st_mincut()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut_value}{\code{st_mincut_value()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut}{\code{mincut}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut_value}{\code{mincut_value}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut}{\code{st_mincut}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut_value}{\code{st_mincut_value}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \keyword{internal}
diff --git a/man/graph.motifs.Rd b/man/graph.motifs.Rd
index e6220422fba..26e9ee1b01b 100644
--- a/man/graph.motifs.Rd
+++ b/man/graph.motifs.Rd
@@ -24,7 +24,7 @@ If \verb{rep(0, size))}, the default, no cuts are made.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu}{\code{motifs_randesu()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_callback}{\code{motifs_randesu_callback_closure()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu}{\code{motifs_randesu}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_callback}{\code{motifs_randesu_callback_closure()}}
 }
 
 \keyword{internal}
diff --git a/man/graph.motifs.est.Rd b/man/graph.motifs.est.Rd
index 70f150e91d1..d75e379a4ac 100644
--- a/man/graph.motifs.est.Rd
+++ b/man/graph.motifs.est.Rd
@@ -37,7 +37,7 @@ starting point for finding motifs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_estimate}{\code{motifs_randesu_estimate()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_estimate}{\code{motifs_randesu_estimate}}
 }
 
 \keyword{internal}
diff --git a/man/graph.motifs.no.Rd b/man/graph.motifs.no.Rd
index 35d4dbd3b8c..8293f9b4ceb 100644
--- a/man/graph.motifs.no.Rd
+++ b/man/graph.motifs.no.Rd
@@ -23,7 +23,7 @@ If \code{NULL}, the default, no cuts are made.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_no}{\code{motifs_randesu_no()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_no}{\code{motifs_randesu_no}}
 }
 
 \keyword{internal}
diff --git a/man/graph.neighborhood.Rd b/man/graph.neighborhood.Rd
index 3a52ea1951c..d533ec9e1cb 100644
--- a/man/graph.neighborhood.Rd
+++ b/man/graph.neighborhood.Rd
@@ -37,7 +37,7 @@ argument is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.ring.Rd b/man/graph.ring.Rd
index 153380f6475..2c7a84f1942 100644
--- a/man/graph.ring.Rd
+++ b/man/graph.ring.Rd
@@ -25,7 +25,7 @@ vertex has one child.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_ring}{\code{ring()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_ring}{\code{ring}}
 }
 
 \keyword{internal}
diff --git a/man/graph.star.Rd b/man/graph.star.Rd
index 40d33ca94b6..ca2d6a55dd2 100644
--- a/man/graph.star.Rd
+++ b/man/graph.star.Rd
@@ -24,7 +24,7 @@ are undirected.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_star}{\code{star()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_star}{\code{star}}
 }
 
 \keyword{internal}
diff --git a/man/graph.strength.Rd b/man/graph.strength.Rd
index d4cc8e6242d..ec67e002223 100644
--- a/man/graph.strength.Rd
+++ b/man/graph.strength.Rd
@@ -36,7 +36,7 @@ attribute, then this is used by default. If the graph does not have a
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph.tree.Rd b/man/graph.tree.Rd
index 754ef310199..a853055ffd2 100644
--- a/man/graph.tree.Rd
+++ b/man/graph.tree.Rd
@@ -25,7 +25,7 @@ graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kary_tree}{\code{kary_tree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kary_tree}{\code{kary_tree}}
 }
 
 \keyword{internal}
diff --git a/man/graph.union.Rd b/man/graph.union.Rd
index 63d7e5f96d4..688bced241d 100644
--- a/man/graph.union.Rd
+++ b/man/graph.union.Rd
@@ -22,7 +22,7 @@ graphs are named.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph_.Rd b/man/graph_.Rd
index 91136d98fc5..07b0c5a3028 100644
--- a/man/graph_.Rd
+++ b/man/graph_.Rd
@@ -16,7 +16,7 @@ This is a generic function to convert R objects to igraph graphs.
 TODO
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_center.Rd b/man/graph_center.Rd
index 811691bdb93..75f9ac8c1bf 100644
--- a/man/graph_center.Rd
+++ b/man/graph_center.Rd
@@ -33,7 +33,7 @@ The vertex IDs of the central vertices.
 The center of a graph is the set of its vertices with minimal eccentricity.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{graph_center_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_graph_center_dijkstra}{\code{graph_center_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_from_adj_list.Rd b/man/graph_from_adj_list.Rd
index 50799d87960..293d3315546 100644
--- a/man/graph_from_adj_list.Rd
+++ b/man/graph_from_adj_list.Rd
@@ -45,7 +45,7 @@ The idea is that you convert your graph to an adjacency list by
 create again an igraph graph by calling \code{graph_from_adj_list()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist}}
 }
 
 \examples{
diff --git a/man/graph_from_adjacency_matrix.Rd b/man/graph_from_adjacency_matrix.Rd
index 44138010bfb..9b1c3d543c4 100644
--- a/man/graph_from_adjacency_matrix.Rd
+++ b/man/graph_from_adjacency_matrix.Rd
@@ -141,7 +141,7 @@ gives the edge weights.
 }
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjacency}{\code{adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_weighted_adjacency}{\code{weighted_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjacency}{\code{adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_weighted_adjacency}{\code{weighted_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_from_atlas.Rd b/man/graph_from_atlas.Rd
index b0da21ad9a0..a193e0a1a46 100644
--- a/man/graph_from_atlas.Rd
+++ b/man/graph_from_atlas.Rd
@@ -32,7 +32,7 @@ automorphisms.
 }
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_atlas}{\code{atlas()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_atlas}{\code{atlas}}
 }
 
 \examples{
diff --git a/man/graph_from_biadjacency_matrix.Rd b/man/graph_from_biadjacency_matrix.Rd
index 03bdb69fc30..33176fb1a82 100644
--- a/man/graph_from_biadjacency_matrix.Rd
+++ b/man/graph_from_biadjacency_matrix.Rd
@@ -72,7 +72,7 @@ Some authors refer to the bipartite adjacency matrix as the
 this naming to avoid confusion with the edge-vertex incidence matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_from_data_frame.Rd b/man/graph_from_data_frame.Rd
index a2ba4f92877..de434a60caf 100644
--- a/man/graph_from_data_frame.Rd
+++ b/man/graph_from_data_frame.Rd
@@ -95,7 +95,7 @@ touched. In other words, vertex names (=the first column) cannot be
 \code{NA}, but other vertex attributes can.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_add_vertices}{\code{add_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_from_edgelist.Rd b/man/graph_from_edgelist.Rd
index d51df54d96c..97e584ef676 100644
--- a/man/graph_from_edgelist.Rd
+++ b/man/graph_from_edgelist.Rd
@@ -28,7 +28,7 @@ names and a vertex id will be assigned to each name, and also a
 \code{name} vertex attribute will be added.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}
 }
 
 \examples{
diff --git a/man/graph_from_graphdb.Rd b/man/graph_from_graphdb.Rd
index da8579f9d11..6284740bc45 100644
--- a/man/graph_from_graphdb.Rd
+++ b/man/graph_from_graphdb.Rd
@@ -72,7 +72,7 @@ its old version at
 for the actual format of a graph database file and other information.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb}}
 }
 
 \references{
diff --git a/man/graph_from_graphnel.Rd b/man/graph_from_graphnel.Rd
index b61aaf7f6fb..0cd589a8c4d 100644
--- a/man/graph_from_graphnel.Rd
+++ b/man/graph_from_graphnel.Rd
@@ -39,7 +39,7 @@ attributes of the multiple edges are lost: they are all replaced by the
 attributes of the first of the multiple edges.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/graph_from_incidence_matrix.Rd b/man/graph_from_incidence_matrix.Rd
index cc40a0d7df5..d2c7a243da4 100644
--- a/man/graph_from_incidence_matrix.Rd
+++ b/man/graph_from_incidence_matrix.Rd
@@ -18,7 +18,7 @@ Some authors refer to the bipartite adjacency matrix as the
 this naming to avoid confusion with the edge-vertex incidence matrix.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_biadjacency}{\code{biadjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graph_from_isomorphism_class.Rd b/man/graph_from_isomorphism_class.Rd
index 1f072e599c0..cbbe7527fb7 100644
--- a/man/graph_from_isomorphism_class.Rd
+++ b/man/graph_from_isomorphism_class.Rd
@@ -25,7 +25,7 @@ isomorphism class. Currently it can handle directed graphs with 3 or 4
 vertices and undirected graphd with 3 to 6 vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_create}{\code{isoclass_create}}
 }
 
 \seealso{
diff --git a/man/graph_from_lcf.Rd b/man/graph_from_lcf.Rd
index 94fd3d0e74a..72cbaf4ac44 100644
--- a/man/graph_from_lcf.Rd
+++ b/man/graph_from_lcf.Rd
@@ -28,7 +28,7 @@ be performed.
 See \url{https://mathworld.wolfram.com/LCFNotation.html} for details.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lcf_vector}{\code{lcf_vector}}
 }
 
 \examples{
diff --git a/man/graph_from_literal.Rd b/man/graph_from_literal.Rd
index a9efc4fd688..d02eb458fe0 100644
--- a/man/graph_from_literal.Rd
+++ b/man/graph_from_literal.Rd
@@ -92,7 +92,7 @@ You can include any character in the vertex names this way, even
 See more examples below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}
 }
 
 \examples{
diff --git a/man/graphlet_basis.Rd b/man/graphlet_basis.Rd
index 27ad65fc01b..5397bf9df8e 100644
--- a/man/graphlet_basis.Rd
+++ b/man/graphlet_basis.Rd
@@ -76,7 +76,7 @@ the algorithm, and they are useful if the user wishes to perform them
 individually: \code{graphlet_basis()} and \code{graphlet_proj()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_candidate_basis}{\code{graphlets_candidate_basis()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_project}{\code{graphlets_project()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets}{\code{graphlets()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_candidate_basis}{\code{graphlets_candidate_basis}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_project}{\code{graphlets_project}}, \href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets}{\code{graphlets}}
 }
 
 \examples{
diff --git a/man/graphlets.candidate.basis.Rd b/man/graphlets.candidate.basis.Rd
index b72de6dc592..a162708f8d5 100644
--- a/man/graphlets.candidate.basis.Rd
+++ b/man/graphlets.candidate.basis.Rd
@@ -21,7 +21,7 @@ attribute is used.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_candidate_basis}{\code{graphlets_candidate_basis()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_candidate_basis}{\code{graphlets_candidate_basis}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/graphlets.project.Rd b/man/graphlets.project.Rd
index ddedfe4af57..f3154d7df1a 100644
--- a/man/graphlets.project.Rd
+++ b/man/graphlets.project.Rd
@@ -34,7 +34,7 @@ projection.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_project}{\code{graphlets_project()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Graphlets.html#igraph_graphlets_project}{\code{graphlets_project}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/greedy_vertex_coloring.Rd b/man/greedy_vertex_coloring.Rd
index 767ec078d27..5dc46267139 100644
--- a/man/greedy_vertex_coloring.Rd
+++ b/man/greedy_vertex_coloring.Rd
@@ -34,7 +34,7 @@ obtained this way is not necessarily minimum but it can be calculated in
 linear time.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{vertex_coloring_greedy()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Coloring.html#igraph_vertex_coloring_greedy}{\code{vertex_coloring_greedy}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/grg.game.Rd b/man/grg.game.Rd
index bb1f0e76d49..1ceb791d1c4 100644
--- a/man/grg.game.Rd
+++ b/man/grg.game.Rd
@@ -24,7 +24,7 @@ as vertex attributes called \sQuote{\code{x}} and \sQuote{\code{y}}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/growing.random.game.Rd b/man/growing.random.game.Rd
index 1f10b90f700..cfa4de23d25 100644
--- a/man/growing.random.game.Rd
+++ b/man/growing.random.game.Rd
@@ -23,7 +23,7 @@ each time step the added edges are originating from the new vertex.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game}}
 }
 
 \keyword{internal}
diff --git a/man/gsize.Rd b/man/gsize.Rd
index 788c7f2f2ab..740ca8df015 100644
--- a/man/gsize.Rd
+++ b/man/gsize.Rd
@@ -19,7 +19,7 @@ Numeric scalar, the number of edges.
 \code{ecount()} and \code{gsize()} are aliases.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/handle_vertex_type_arg.Rd b/man/handle_vertex_type_arg.Rd
index 2dd4a885078..59f7c73a596 100644
--- a/man/handle_vertex_type_arg.Rd
+++ b/man/handle_vertex_type_arg.Rd
@@ -28,7 +28,7 @@ vertex types. Non-logical vertex type vectors are coerced into logical
 vectors after printing a warning.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \author{
diff --git a/man/harmonic_centrality.Rd b/man/harmonic_centrality.Rd
index 4d22bbe160d..04f5ac60980 100644
--- a/man/harmonic_centrality.Rd
+++ b/man/harmonic_centrality.Rd
@@ -53,7 +53,7 @@ to speed up the calculation. If \code{cutoff} is negative (which is the
 default), then the function calculates the exact harmonic centrality scores.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{harmonic_centrality_cutoff()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_harmonic_centrality_cutoff}{\code{harmonic_centrality_cutoff}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/has.multiple.Rd b/man/has.multiple.Rd
index 318966fa07e..b2faacc86d9 100644
--- a/man/has.multiple.Rd
+++ b/man/has.multiple.Rd
@@ -16,7 +16,7 @@ has.multiple(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple}}
 }
 
 \keyword{internal}
diff --git a/man/has_eulerian_path.Rd b/man/has_eulerian_path.Rd
index 816d3b92e97..f21107e1ffe 100644
--- a/man/has_eulerian_path.Rd
+++ b/man/has_eulerian_path.Rd
@@ -52,7 +52,7 @@ a result. \code{eulerian_cycle()} returns a possible Eulerian cycle, described
 with its edge and vertex sequence, or throws an error if no such cycle exists.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_is_eulerian}{\code{is_eulerian()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_eulerian_path}{\code{eulerian_path()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_eulerian_cycle}{\code{eulerian_cycle()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_is_eulerian}{\code{is_eulerian}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_eulerian_path}{\code{eulerian_path}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_eulerian_cycle}{\code{eulerian_cycle}}
 }
 
 \examples{
diff --git a/man/head_of.Rd b/man/head_of.Rd
index 034d42873a1..a122faf0fb3 100644
--- a/man/head_of.Rd
+++ b/man/head_of.Rd
@@ -20,7 +20,7 @@ For undirected graphs, head and tail is not defined.  In this case
 \code{tail_of()} returns the other end(s) of the edge(s).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/hits_scores.Rd b/man/hits_scores.Rd
index d79bed8177c..d042451c764 100644
--- a/man/hits_scores.Rd
+++ b/man/hits_scores.Rd
@@ -61,7 +61,7 @@ For undirected matrices the adjacency matrix is symmetric and the hub
 scores are the same as authority scores.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/hrg.Rd b/man/hrg.Rd
index 83a6541de5e..0b88a3a995a 100644
--- a/man/hrg.Rd
+++ b/man/hrg.Rd
@@ -22,7 +22,7 @@ vertices. The \code{prob} argument contains the HRG probability labels
 for each vertex; these are ignored for leaf vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create}}
 }
 
 \seealso{
diff --git a/man/hrg.consensus.Rd b/man/hrg.consensus.Rd
index 1b38683cbc5..79927259d4c 100644
--- a/man/hrg.consensus.Rd
+++ b/man/hrg.consensus.Rd
@@ -27,7 +27,7 @@ missing edge prediction.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_consensus}{\code{hrg_consensus}}
 }
 
 \keyword{internal}
diff --git a/man/hrg.create.Rd b/man/hrg.create.Rd
index f94ce67eecc..10c7a685820 100644
--- a/man/hrg.create.Rd
+++ b/man/hrg.create.Rd
@@ -19,7 +19,7 @@ vertex ids.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_create}{\code{hrg_create}}
 }
 
 \keyword{internal}
diff --git a/man/hrg.dendrogram.Rd b/man/hrg.dendrogram.Rd
index 75c18c76c22..ace3a136f17 100644
--- a/man/hrg.dendrogram.Rd
+++ b/man/hrg.dendrogram.Rd
@@ -16,7 +16,7 @@ hrg.dendrogram(hrg)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/hrg.fit.Rd b/man/hrg.fit.Rd
index 688a2628ce9..09557d4f691 100644
--- a/man/hrg.fit.Rd
+++ b/man/hrg.fit.Rd
@@ -27,7 +27,7 @@ MCMC procedure is performed until convergence.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_fit}{\code{hrg_fit()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_fit}{\code{hrg_fit}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/hrg.game.Rd b/man/hrg.game.Rd
index c2c70f5960a..8da697ba84a 100644
--- a/man/hrg.game.Rd
+++ b/man/hrg.game.Rd
@@ -16,7 +16,7 @@ hrg.game(hrg)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game}}
 }
 
 \keyword{internal}
diff --git a/man/hrg.predict.Rd b/man/hrg.predict.Rd
index 6ec3fdb1dc9..ce2091d5b4c 100644
--- a/man/hrg.predict.Rd
+++ b/man/hrg.predict.Rd
@@ -37,7 +37,7 @@ number for a more accurate prediction.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_predict}{\code{hrg_predict()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_predict}{\code{hrg_predict}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/hrg_tree.Rd b/man/hrg_tree.Rd
index 2404b4982bf..fe8272e6616 100644
--- a/man/hrg_tree.Rd
+++ b/man/hrg_tree.Rd
@@ -17,7 +17,7 @@ An igraph graph with a vertex attribute called \code{"probability"}.
 random graph model.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_from_hrg_dendrogram}{\code{from_hrg_dendrogram}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \seealso{
diff --git a/man/hub.score.Rd b/man/hub.score.Rd
index b95ec832ae2..f1424f40b3f 100644
--- a/man/hub.score.Rd
+++ b/man/hub.score.Rd
@@ -30,7 +30,7 @@ selected by the surfer.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/hub_score.Rd b/man/hub_score.Rd
index 7fa27ff88e2..aee91cab229 100644
--- a/man/hub_score.Rd
+++ b/man/hub_score.Rd
@@ -37,7 +37,7 @@ Kleinberg's authority centrality scores.
 Kleinberg's hub centrality scores.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_hub_and_authority_scores}{\code{hub_and_authority_scores}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/igraph.from.graphNEL.Rd b/man/igraph.from.graphNEL.Rd
index d60e9cc6e32..5ab7dab9ee7 100644
--- a/man/igraph.from.graphNEL.Rd
+++ b/man/igraph.from.graphNEL.Rd
@@ -28,7 +28,7 @@ whenever possible, before adding them to the igraph graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_adjlist}{\code{adjlist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/igraph.sample.Rd b/man/igraph.sample.Rd
index 11dbb5cb1c3..62762fe58e2 100644
--- a/man/igraph.sample.Rd
+++ b/man/igraph.sample.Rd
@@ -20,7 +20,7 @@ igraph.sample(low, high, length)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_random_sample}{\code{random_sample()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_random_sample}{\code{random_sample}}
 }
 
 \keyword{internal}
diff --git a/man/igraph.to.graphNEL.Rd b/man/igraph.to.graphNEL.Rd
index 6ed6c0a0347..3e5f1725659 100644
--- a/man/igraph.to.graphNEL.Rd
+++ b/man/igraph.to.graphNEL.Rd
@@ -16,7 +16,7 @@ igraph.to.graphNEL(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/igraph.version.Rd b/man/igraph.version.Rd
index ddd5bcd1b09..80666c00d4b 100644
--- a/man/igraph.version.Rd
+++ b/man/igraph.version.Rd
@@ -13,7 +13,7 @@ igraph.version()
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_version}{\code{version()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_version}{\code{version}}
 }
 
 \keyword{internal}
diff --git a/man/igraph_version.Rd b/man/igraph_version.Rd
index cf8ed8559aa..f67ebca093e 100644
--- a/man/igraph_version.Rd
+++ b/man/igraph_version.Rd
@@ -15,7 +15,7 @@ Returns the R package version,
 prints the R package version and C library version.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_version}{\code{version()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_version}{\code{version}}
 }
 
 \examples{
diff --git a/man/incident.Rd b/man/incident.Rd
index 70847942dac..d357cbe25dc 100644
--- a/man/incident.Rd
+++ b/man/incident.Rd
@@ -23,7 +23,7 @@ the input vertex.
 Incident edges of a vertex in a graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_incident}{\code{incident()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_incident}{\code{incident}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/incident_edges.Rd b/man/incident_edges.Rd
index 8743233333f..17e2e189f33 100644
--- a/man/incident_edges.Rd
+++ b/man/incident_edges.Rd
@@ -23,7 +23,7 @@ This function is similar to \code{\link[=incident]{incident()}}, but it
 queries multiple vertices at once.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/independence.number.Rd b/man/independence.number.Rd
index 2fe69fcef73..630708f31b2 100644
--- a/man/independence.number.Rd
+++ b/man/independence.number.Rd
@@ -16,7 +16,7 @@ independence.number(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_independence_number}{\code{independence_number()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_independence_number}{\code{independence_number}}
 }
 
 \keyword{internal}
diff --git a/man/independent.vertex.sets.Rd b/man/independent.vertex.sets.Rd
index 742b5d11683..25f2b0d202e 100644
--- a/man/independent.vertex.sets.Rd
+++ b/man/independent.vertex.sets.Rd
@@ -22,7 +22,7 @@ vertex sets to find. \code{NULL} means no limit.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/induced.subgraph.Rd b/man/induced.subgraph.Rd
index 78e14f9f85c..159742a9ebc 100644
--- a/man/induced.subgraph.Rd
+++ b/man/induced.subgraph.Rd
@@ -32,7 +32,7 @@ result graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/infomap.community.Rd b/man/infomap.community.Rd
index ab495bde6d1..c9594c11d84 100644
--- a/man/infomap.community.Rd
+++ b/man/infomap.community.Rd
@@ -41,7 +41,7 @@ of the detected community structure.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_infomap}{\code{community_infomap()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_infomap}{\code{community_infomap}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/inside-square-error.Rd b/man/inside-square-error.Rd
index eadd774876c..9c0e8444480 100644
--- a/man/inside-square-error.Rd
+++ b/man/inside-square-error.Rd
@@ -34,7 +34,7 @@ Functions to be used only with \verb{[.igraph.es} and \verb{[.igraph.vs}
 See \code{\link[igraph]{[.igraph.vs}} and \code{\link[igraph]{[.igraph.es}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/interconnected.islands.game.Rd b/man/interconnected.islands.game.Rd
index 77498be227a..0b637b3dab2 100644
--- a/man/interconnected.islands.game.Rd
+++ b/man/interconnected.islands.game.Rd
@@ -23,7 +23,7 @@ island.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game}}
 }
 
 \keyword{internal}
diff --git a/man/intersection.igraph.Rd b/man/intersection.igraph.Rd
index 6de4ea851cc..4e088e4dd2f 100644
--- a/man/intersection.igraph.Rd
+++ b/man/intersection.igraph.Rd
@@ -48,7 +48,7 @@ An error is generated if some input graphs are directed and others are
 undirected.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/invalidate_cache.Rd b/man/invalidate_cache.Rd
index 23a368a6bd4..8aa27472a5c 100644
--- a/man/invalidate_cache.Rd
+++ b/man/invalidate_cache.Rd
@@ -27,7 +27,7 @@ invalid cache entry is when the result of a cached function (such as
 this function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_invalidate_cache}{\code{invalidate_cache()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_invalidate_cache}{\code{invalidate_cache}}
 }
 
 \examples{
diff --git a/man/is.connected.Rd b/man/is.connected.Rd
index 3450acb5dbb..69da64751ff 100644
--- a/man/is.connected.Rd
+++ b/man/is.connected.Rd
@@ -20,7 +20,7 @@ connected components to search. It is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_connected}{\code{is_connected()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_connected}{\code{is_connected}}
 }
 
 \keyword{internal}
diff --git a/man/is.dag.Rd b/man/is.dag.Rd
index 9d93f1bf013..aa2f76ea770 100644
--- a/man/is.dag.Rd
+++ b/man/is.dag.Rd
@@ -17,7 +17,7 @@ is.dag(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_dag}{\code{is_dag()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_dag}{\code{is_dag}}
 }
 
 \keyword{internal}
diff --git a/man/is.degree.sequence.Rd b/man/is.degree.sequence.Rd
index 2d240fcdc0e..fde63eb66d3 100644
--- a/man/is.degree.sequence.Rd
+++ b/man/is.degree.sequence.Rd
@@ -20,7 +20,7 @@ should be \code{NULL}. For directed graphs it specifies the in-degrees.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical}}
 }
 
 \keyword{internal}
diff --git a/man/is.directed.Rd b/man/is.directed.Rd
index f33093a86e3..d92e2a02373 100644
--- a/man/is.directed.Rd
+++ b/man/is.directed.Rd
@@ -16,7 +16,7 @@ is.directed(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}
 }
 
 \keyword{internal}
diff --git a/man/is.graphical.degree.sequence.Rd b/man/is.graphical.degree.sequence.Rd
index 99f3a6dc875..92ac7ed1943 100644
--- a/man/is.graphical.degree.sequence.Rd
+++ b/man/is.graphical.degree.sequence.Rd
@@ -31,7 +31,7 @@ allowed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical}}
 }
 
 \keyword{internal}
diff --git a/man/is.loop.Rd b/man/is.loop.Rd
index afbc31e9cc2..b5f3326d910 100644
--- a/man/is.loop.Rd
+++ b/man/is.loop.Rd
@@ -19,7 +19,7 @@ all edges in the graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/is.matching.Rd b/man/is.matching.Rd
index 56ac7bbb9f8..8f480468457 100644
--- a/man/is.matching.Rd
+++ b/man/is.matching.Rd
@@ -24,7 +24,7 @@ are taken from the \sQuote{\code{type}} vertex attribute, if present.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_matching}{\code{is_matching()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_matching}{\code{is_matching}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/is.maximal.matching.Rd b/man/is.maximal.matching.Rd
index f798591241c..2dcea519899 100644
--- a/man/is.maximal.matching.Rd
+++ b/man/is.maximal.matching.Rd
@@ -24,7 +24,7 @@ are taken from the \sQuote{\code{type}} vertex attribute, if present.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_maximal_matching}{\code{is_maximal_matching()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_maximal_matching}{\code{is_maximal_matching}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/is.minimal.separator.Rd b/man/is.minimal.separator.Rd
index 4a908c16420..a0c1c0db17e 100644
--- a/man/is.minimal.separator.Rd
+++ b/man/is.minimal.separator.Rd
@@ -20,7 +20,7 @@ separator.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/is.multiple.Rd b/man/is.multiple.Rd
index 267db47fedc..1bba76f3404 100644
--- a/man/is.multiple.Rd
+++ b/man/is.multiple.Rd
@@ -19,7 +19,7 @@ all edges in the graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/is.mutual.Rd b/man/is.mutual.Rd
index 9ac882179fb..d3b90bdb533 100644
--- a/man/is.mutual.Rd
+++ b/man/is.mutual.Rd
@@ -21,7 +21,7 @@ includes all edges in the order of their ids.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/is.separator.Rd b/man/is.separator.Rd
index e648783c03b..bcad7249876 100644
--- a/man/is.separator.Rd
+++ b/man/is.separator.Rd
@@ -20,7 +20,7 @@ separator.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_separator}{\code{is_separator()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_separator}{\code{is_separator}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/is.simple.Rd b/man/is.simple.Rd
index 5bd42e09c41..12ae05e68aa 100644
--- a/man/is.simple.Rd
+++ b/man/is.simple.Rd
@@ -16,7 +16,7 @@ is.simple(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_simple}{\code{is_simple()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_simple}{\code{is_simple}}
 }
 
 \keyword{internal}
diff --git a/man/is_acyclic.Rd b/man/is_acyclic.Rd
index 3047826947f..04d2e169e95 100644
--- a/man/is_acyclic.Rd
+++ b/man/is_acyclic.Rd
@@ -20,7 +20,7 @@ This function looks for directed cycles in directed graphs and undirected
 cycles in undirected graphs. Use \code{\link[=find_cycle]{find_cycle()}} to return a specific cycle.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_is_acyclic}{\code{is_acyclic()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_is_acyclic}{\code{is_acyclic}}
 }
 
 \examples{
diff --git a/man/is_biconnected.Rd b/man/is_biconnected.Rd
index c4d204d9272..17666b9c7f8 100644
--- a/man/is_biconnected.Rd
+++ b/man/is_biconnected.Rd
@@ -27,7 +27,7 @@ Note that some authors do not consider the graph consisting of
 two connected vertices as biconnected, however, igraph does.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_biconnected}{\code{is_biconnected()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_biconnected}{\code{is_biconnected}}
 }
 
 \examples{
diff --git a/man/is_complete.Rd b/man/is_complete.Rd
index d88087d181c..9fcd4565022 100644
--- a/man/is_complete.Rd
+++ b/man/is_complete.Rd
@@ -18,7 +18,7 @@ directed pairs of vertices. igraph considers both the singleton graph
 and the null graph complete.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_complete}{\code{is_complete()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_complete}{\code{is_complete}}
 }
 
 \examples{
diff --git a/man/is_dag.Rd b/man/is_dag.Rd
index 29586af7b7a..cfa0bc79491 100644
--- a/man/is_dag.Rd
+++ b/man/is_dag.Rd
@@ -22,7 +22,7 @@ graph.
 the graph is a DAG.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_dag}{\code{is_dag()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_dag}{\code{is_dag}}
 }
 
 \examples{
diff --git a/man/is_degseq.Rd b/man/is_degseq.Rd
index 2ec9c9d028b..b1ac7d12241 100644
--- a/man/is_degseq.Rd
+++ b/man/is_degseq.Rd
@@ -26,7 +26,7 @@ degree vectors are equal and whether their sums are also equal. These are
 known sufficient and necessary conditions for a degree sequence to be valid.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical}}
 }
 
 \examples{
diff --git a/man/is_directed.Rd b/man/is_directed.Rd
index 023bcdc1ad5..b1ee8a5093d 100644
--- a/man/is_directed.Rd
+++ b/man/is_directed.Rd
@@ -16,7 +16,7 @@ Logical scalar, whether the graph is directed.
 Check whether a graph is directed
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}
 }
 
 \examples{
diff --git a/man/is_forest.Rd b/man/is_forest.Rd
index f61f1f52aeb..b7afc98fb23 100644
--- a/man/is_forest.Rd
+++ b/man/is_forest.Rd
@@ -45,7 +45,7 @@ By convention, the null graph (i.e. the graph with no vertices) is considered
 to be a forest.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/is_graphical.Rd b/man/is_graphical.Rd
index 180f2abf2f7..bc69820fb6d 100644
--- a/man/is_graphical.Rd
+++ b/man/is_graphical.Rd
@@ -37,7 +37,7 @@ can perform the check also when self-loops, multi-edges, or both are allowed
 in the graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_graphical}{\code{is_graphical}}
 }
 
 \examples{
diff --git a/man/is_min_separator.Rd b/man/is_min_separator.Rd
index 9dc9d42d758..cb39bd6e0f7 100644
--- a/man/is_min_separator.Rd
+++ b/man/is_min_separator.Rd
@@ -26,7 +26,7 @@ vertex separator. A minimal vertex separator is a vertex separator, such
 that none of its proper subsets are a vertex separator.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_minimal_separator}{\code{is_minimal_separator}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/is_separator.Rd b/man/is_separator.Rd
index 4e5f7d08894..598fb6b9fc5 100644
--- a/man/is_separator.Rd
+++ b/man/is_separator.Rd
@@ -26,7 +26,7 @@ in the graph such that all paths between \eqn{u} and \eqn{v} pass
 through some vertices in \eqn{S}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_separator}{\code{is_separator()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_is_separator}{\code{is_separator}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/is_tree.Rd b/man/is_tree.Rd
index eb0f4655cdb..7ea2baf0e5c 100644
--- a/man/is_tree.Rd
+++ b/man/is_tree.Rd
@@ -45,7 +45,7 @@ By convention, the null graph (i.e. the graph with no vertices) is considered
 not to be a tree.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_tree}{\code{is_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_tree}{\code{is_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/isomorphic.Rd b/man/isomorphic.Rd
index 0f24f9f2739..880ab90fbfb 100644
--- a/man/isomorphic.Rd
+++ b/man/isomorphic.Rd
@@ -94,7 +94,7 @@ Character constant, the heuristics to use in the BLISS algorithm for \code{graph
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic}{\code{isomorphic()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic_bliss}{\code{isomorphic_bliss()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic_vf2}{\code{isomorphic_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic}{\code{isomorphic}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic_bliss}{\code{isomorphic_bliss}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isomorphic_vf2}{\code{isomorphic_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/isomorphism_class.Rd b/man/isomorphism_class.Rd
index 4c2d40d4973..d9880a4e2e9 100644
--- a/man/isomorphism_class.Rd
+++ b/man/isomorphism_class.Rd
@@ -25,7 +25,7 @@ isomorphism class. Currently it can handle directed graphs with 3 or 4
 vertices and undirected graphs with 3 to 6 vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_subgraph}{\code{isoclass_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass}{\code{isoclass()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass_subgraph}{\code{isoclass_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_isoclass}{\code{isoclass}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/isomorphisms.Rd b/man/isomorphisms.Rd
index 797cf898034..2c4c3188400 100644
--- a/man/isomorphisms.Rd
+++ b/man/isomorphisms.Rd
@@ -40,7 +40,7 @@ returns \code{NULL} invisibly.
 Calculate all isomorphic mappings between the vertices of two graphs
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_get_isomorphisms_vf2}{\code{get_isomorphisms_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_get_isomorphisms_vf2}{\code{get_isomorphisms_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/ivs.Rd b/man/ivs.Rd
index 36134a508e6..b010352277a 100644
--- a/man/ivs.Rd
+++ b/man/ivs.Rd
@@ -73,7 +73,7 @@ reference below.
 \code{is_ivs()} tests if no pairs within a vertex set are connected.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_independent_vertex_sets}{\code{largest_independent_vertex_sets()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_independence_number}{\code{independence_number()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_independent_vertex_set}{\code{is_independent_vertex_set()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_independent_vertex_sets}{\code{largest_independent_vertex_sets}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_independence_number}{\code{independence_number}}, \href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_is_independent_vertex_set}{\code{is_independent_vertex_set}}
 }
 
 \examples{
diff --git a/man/k.regular.game.Rd b/man/k.regular.game.Rd
index d814216743c..28bcdf0aee6 100644
--- a/man/k.regular.game.Rd
+++ b/man/k.regular.game.Rd
@@ -24,7 +24,7 @@ out-degree and in-degree in a directed graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game}}
 }
 
 \keyword{internal}
diff --git a/man/k_shortest_paths.Rd b/man/k_shortest_paths.Rd
index ba84b3b8d62..99f0877ef26 100644
--- a/man/k_shortest_paths.Rd
+++ b/man/k_shortest_paths.Rd
@@ -56,7 +56,7 @@ vertex in order of increasing length. Currently this function uses
 Yen's algorithm.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{get_k_shortest_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_k_shortest_paths}{\code{get_k_shortest_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \references{
diff --git a/man/knn.Rd b/man/knn.Rd
index 1edee8f85f5..fe6b38de6b9 100644
--- a/man/knn.Rd
+++ b/man/knn.Rd
@@ -68,7 +68,7 @@ as indicated by \code{mode}. \eqn{w_{uv}}{w_uv} denotes the weighted adjacency m
 and \eqn{k_v}{k_v} is the neighbors' degree, specified by \code{neighbor_degree_mode}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_avg_nearest_neighbor_degree}{\code{avg_nearest_neighbor_degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/label.propagation.community.Rd b/man/label.propagation.community.Rd
index f1c9f64e7d6..6cfeb5e1d4b 100644
--- a/man/label.propagation.community.Rd
+++ b/man/label.propagation.community.Rd
@@ -51,7 +51,7 @@ will be ignored. Also note that vertices without labels cannot be fixed.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_label_propagation}{\code{community_label_propagation()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_label_propagation}{\code{community_label_propagation}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/laplacian_matrix.Rd b/man/laplacian_matrix.Rd
index 3b78256487e..0f0bff0cb1f 100644
--- a/man/laplacian_matrix.Rd
+++ b/man/laplacian_matrix.Rd
@@ -66,7 +66,7 @@ The Laplacian matrix \eqn{L} is defined in terms of the adjacency matrix
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian}{\code{get_laplacian}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_laplacian_sparse}{\code{get_laplacian_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/largest.cliques.Rd b/man/largest.cliques.Rd
index bd5f6f9644c..bc60ba7d5b5 100644
--- a/man/largest.cliques.Rd
+++ b/man/largest.cliques.Rd
@@ -16,7 +16,7 @@ largest.cliques(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_cliques}{\code{largest_cliques}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/largest.independent.vertex.sets.Rd b/man/largest.independent.vertex.sets.Rd
index 8287b1a7dbb..bb5faebbc5e 100644
--- a/man/largest.independent.vertex.sets.Rd
+++ b/man/largest.independent.vertex.sets.Rd
@@ -16,7 +16,7 @@ largest.independent.vertex.sets(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_independent_vertex_sets}{\code{largest_independent_vertex_sets()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_largest_independent_vertex_sets}{\code{largest_independent_vertex_sets}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/lastcit.game.Rd b/man/lastcit.game.Rd
index af171384131..e36accdb5f8 100644
--- a/man/lastcit.game.Rd
+++ b/man/lastcit.game.Rd
@@ -32,7 +32,7 @@ probabilities for the different vertex types.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lastcit_game}{\code{lastcit_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lastcit_game}{\code{lastcit_game}}
 }
 
 \keyword{internal}
diff --git a/man/layout.auto.Rd b/man/layout.auto.Rd
index ff8c13953de..2bb5d5b7ae4 100644
--- a/man/layout.auto.Rd
+++ b/man/layout.auto.Rd
@@ -22,7 +22,7 @@ the real layout function. For \code{nicely()} all argument are passed to
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.bipartite.Rd b/man/layout.bipartite.Rd
index a1d9c50972e..409a34dc18d 100644
--- a/man/layout.bipartite.Rd
+++ b/man/layout.bipartite.Rd
@@ -31,7 +31,7 @@ you have too many edge crossings, increase this.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_bipartite}{\code{layout_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_bipartite}{\code{layout_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.davidson.harel.Rd b/man/layout.davidson.harel.Rd
index 28416461c12..566d202c1b3 100644
--- a/man/layout.davidson.harel.Rd
+++ b/man/layout.davidson.harel.Rd
@@ -53,7 +53,7 @@ the energy function.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_davidson_harel}{\code{layout_davidson_harel()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_davidson_harel}{\code{layout_davidson_harel}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density}}
 }
 
 \keyword{internal}
diff --git a/man/layout.drl.Rd b/man/layout.drl.Rd
index 5a235fd94e0..f1e8ac163ab 100644
--- a/man/layout.drl.Rd
+++ b/man/layout.drl.Rd
@@ -45,7 +45,7 @@ significantly longer to compute.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.fruchterman.reingold.grid.Rd b/man/layout.fruchterman.reingold.grid.Rd
index c9bd2d65c89..67ff048132e 100644
--- a/man/layout.fruchterman.reingold.grid.Rd
+++ b/man/layout.fruchterman.reingold.grid.Rd
@@ -20,7 +20,7 @@ Layout coordinates, a two column matrix.
 Now it calls the Fruchterman-Reingold layout \code{\link[=layout_with_fr]{layout_with_fr()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.gem.Rd b/man/layout.gem.Rd
index 56e0bd64b58..5c01ebb365b 100644
--- a/man/layout.gem.Rd
+++ b/man/layout.gem.Rd
@@ -42,7 +42,7 @@ default is the square root of the number of vertices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_gem}{\code{layout_gem()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_gem}{\code{layout_gem}}
 }
 
 \keyword{internal}
diff --git a/man/layout.grid.Rd b/man/layout.grid.Rd
index 8982c9a8241..fecf358ab45 100644
--- a/man/layout.grid.Rd
+++ b/man/layout.grid.Rd
@@ -27,7 +27,7 @@ determinted automatically.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid}{\code{layout_grid()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid_3d}{\code{layout_grid_3d()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid}{\code{layout_grid}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid_3d}{\code{layout_grid_3d}}
 }
 
 \keyword{internal}
diff --git a/man/layout.mds.Rd b/man/layout.mds.Rd
index e147b15695a..11b86842d1d 100644
--- a/man/layout.mds.Rd
+++ b/man/layout.mds.Rd
@@ -27,7 +27,7 @@ solving the eigenproblem}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_mds}{\code{layout_mds()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_mds}{\code{layout_mds}}
 }
 
 \keyword{internal}
diff --git a/man/layout.spring.Rd b/man/layout.spring.Rd
index b876cffadcd..71e8dc6579c 100644
--- a/man/layout.spring.Rd
+++ b/man/layout.spring.Rd
@@ -20,7 +20,7 @@ Layout coordinates, a two column matrix.
 Now it calls the Fruchterman-Reingold layout \code{\link[=layout_with_fr]{layout_with_fr()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.star.Rd b/man/layout.star.Rd
index 30fb682726b..126e7eeb00f 100644
--- a/man/layout.star.Rd
+++ b/man/layout.star.Rd
@@ -22,7 +22,7 @@ The default ordering is given by the vertex ids.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_star}{\code{layout_star()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_star}{\code{layout_star}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle}}
 }
 
 \keyword{internal}
diff --git a/man/layout.sugiyama.Rd b/man/layout.sugiyama.Rd
index fd4c396502b..c73e688eb65 100644
--- a/man/layout.sugiyama.Rd
+++ b/man/layout.sugiyama.Rd
@@ -50,7 +50,7 @@ them.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sugiyama}{\code{layout_sugiyama()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sugiyama}{\code{layout_sugiyama}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout.svd.Rd b/man/layout.svd.Rd
index 08f44ed6d11..60ed3c6c4a3 100644
--- a/man/layout.svd.Rd
+++ b/man/layout.svd.Rd
@@ -20,7 +20,7 @@ Layout coordinates, a two column matrix.
 Now it calls the Fruchterman-Reingold layout \code{\link[=layout_with_fr]{layout_with_fr()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/layout_as_bipartite.Rd b/man/layout_as_bipartite.Rd
index 93196d3f435..b3895e766e9 100644
--- a/man/layout_as_bipartite.Rd
+++ b/man/layout_as_bipartite.Rd
@@ -44,7 +44,7 @@ edge crossings, using the Sugiyama algorithm (see
 \code{\link[=layout_with_sugiyama]{layout_with_sugiyama()}}).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_bipartite}{\code{layout_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_bipartite}{\code{layout_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/layout_as_star.Rd b/man/layout_as_star.Rd
index df82c10d561..5b9a86bfef1 100644
--- a/man/layout_as_star.Rd
+++ b/man/layout_as_star.Rd
@@ -33,7 +33,7 @@ It is possible to choose the vertex that will be in the center, and the
 order of the vertices can be also given.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_star}{\code{layout_star()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_star}{\code{layout_star}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle}}
 }
 
 \examples{
diff --git a/man/layout_as_tree.Rd b/man/layout_as_tree.Rd
index 4437d5c136a..b7a4827dec7 100644
--- a/man/layout_as_tree.Rd
+++ b/man/layout_as_tree.Rd
@@ -64,7 +64,7 @@ If the given graph is not a tree, a breadth-first search is executed first
 to obtain a possible spanning tree.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/layout_in_circle.Rd b/man/layout_in_circle.Rd
index 7c3b29e2906..6814db1e8ab 100644
--- a/man/layout_in_circle.Rd
+++ b/man/layout_in_circle.Rd
@@ -29,7 +29,7 @@ If you want to order the vertices differently, then permute them using the
 \code{\link[=permute]{permute()}} function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_circle}{\code{layout_circle}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/layout_nicely.Rd b/man/layout_nicely.Rd
index 311274d87c1..f862ddced96 100644
--- a/man/layout_nicely.Rd
+++ b/man/layout_nicely.Rd
@@ -59,7 +59,7 @@ forward the weights to these functions and issue a warning about this. You
 can use \code{weights = NA} to silence the warning.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_align}{\code{layout_align}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_forest}{\code{is_forest}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/layout_on_grid.Rd b/man/layout_on_grid.Rd
index 885cb76fa80..95aa250d6d2 100644
--- a/man/layout_on_grid.Rd
+++ b/man/layout_on_grid.Rd
@@ -38,7 +38,7 @@ other. If you want to change the order of the vertices, then see the
 \code{\link[=permute]{permute()}} function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid}{\code{layout_grid()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid_3d}{\code{layout_grid_3d()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid}{\code{layout_grid}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_grid_3d}{\code{layout_grid_3d}}
 }
 
 \examples{
diff --git a/man/layout_on_sphere.Rd b/man/layout_on_sphere.Rd
index 12a8817278f..a88afe7cf8e 100644
--- a/man/layout_on_sphere.Rd
+++ b/man/layout_on_sphere.Rd
@@ -30,7 +30,7 @@ If you want to order the vertices differently, then permute them using the
 \code{\link[=permute]{permute()}} function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sphere}{\code{layout_sphere()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sphere}{\code{layout_sphere}}
 }
 
 \seealso{
diff --git a/man/layout_randomly.Rd b/man/layout_randomly.Rd
index c9252dd82bd..241eced6ccb 100644
--- a/man/layout_randomly.Rd
+++ b/man/layout_randomly.Rd
@@ -30,7 +30,7 @@ is probably a useless layout, but it can use as a starting point for other
 layout generators.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_random}{\code{layout_random()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_random_3d}{\code{layout_random_3d()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_random}{\code{layout_random}}, \href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_random_3d}{\code{layout_random_3d}}
 }
 
 \seealso{
diff --git a/man/layout_with_dh.Rd b/man/layout_with_dh.Rd
index d6c6ec15c61..f1d1ad2ebd9 100644
--- a/man/layout_with_dh.Rd
+++ b/man/layout_with_dh.Rd
@@ -85,7 +85,7 @@ possible. The only major difference is that coordinates are explicitly kept
 within the bounds of the rectangle of the layout.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_davidson_harel}{\code{layout_davidson_harel()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_davidson_harel}{\code{layout_davidson_harel}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density}}
 }
 
 \examples{
diff --git a/man/layout_with_drl.Rd b/man/layout_with_drl.Rd
index 16781d7ede3..caa273d7821 100644
--- a/man/layout_with_drl.Rd
+++ b/man/layout_with_drl.Rd
@@ -145,7 +145,7 @@ There are five pre-defined parameter settings as well, these are called
 \code{drl_defaults$final}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/layout_with_fr.Rd b/man/layout_with_fr.Rd
index 70f8316f4b5..bbc35e6bd1c 100644
--- a/man/layout_with_fr.Rd
+++ b/man/layout_with_fr.Rd
@@ -96,7 +96,7 @@ See the referenced paper below for the details of the algorithm.
 This function was rewritten from scratch in igraph version 0.8.0.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/layout_with_gem.Rd b/man/layout_with_gem.Rd
index 495e83b2206..ca96f7db974 100644
--- a/man/layout_with_gem.Rd
+++ b/man/layout_with_gem.Rd
@@ -51,7 +51,7 @@ Place vertices on the plane using the GEM force-directed layout algorithm.
 See the referenced paper below for the details of the algorithm.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_gem}{\code{layout_gem()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_gem}{\code{layout_gem}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/layout_with_kk.Rd b/man/layout_with_kk.Rd
index 7bd47c2b2b1..559a04bf322 100644
--- a/man/layout_with_kk.Rd
+++ b/man/layout_with_kk.Rd
@@ -95,7 +95,7 @@ This function was rewritten from scratch in igraph version 0.8.0 and it
 follows truthfully the original publication by Kamada and Kawai now.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/layout_with_lgl.Rd b/man/layout_with_lgl.Rd
index e2086d39154..d336fcc48e1 100644
--- a/man/layout_with_lgl.Rd
+++ b/man/layout_with_lgl.Rd
@@ -56,7 +56,7 @@ generator of the Large Graph Layout software
 (\url{https://lgl.sourceforge.net/}).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \seealso{
diff --git a/man/layout_with_mds.Rd b/man/layout_with_mds.Rd
index dfc38c0402f..fe0513f3b59 100644
--- a/man/layout_with_mds.Rd
+++ b/man/layout_with_mds.Rd
@@ -49,7 +49,7 @@ This function generates the layout separately for each graph component and
 then merges them via \code{\link[=merge_coords]{merge_coords()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_mds}{\code{layout_mds()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_mds}{\code{layout_mds}}
 }
 
 \examples{
diff --git a/man/layout_with_sugiyama.Rd b/man/layout_with_sugiyama.Rd
index 588fe651787..87b5fe8b611 100644
--- a/man/layout_with_sugiyama.Rd
+++ b/man/layout_with_sugiyama.Rd
@@ -92,7 +92,7 @@ the dummy nodes.
 For more details, see the reference below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sugiyama}{\code{layout_sugiyama()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Layout.html#igraph_layout_sugiyama}{\code{layout_sugiyama}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/leading.eigenvector.community.Rd b/man/leading.eigenvector.community.Rd
index 45c9881f8f2..ed059d87f20 100644
--- a/man/leading.eigenvector.community.Rd
+++ b/man/leading.eigenvector.community.Rd
@@ -50,7 +50,7 @@ the modularity matrix. See details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/line.graph.Rd b/man/line.graph.Rd
index e4bf1142c52..5a239e0f226 100644
--- a/man/line.graph.Rd
+++ b/man/line.graph.Rd
@@ -16,7 +16,7 @@ line.graph(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_linegraph}{\code{linegraph()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_linegraph}{\code{linegraph}}
 }
 
 \keyword{internal}
diff --git a/man/local_scan.Rd b/man/local_scan.Rd
index 290f27b0551..683b17a75a6 100644
--- a/man/local_scan.Rd
+++ b/man/local_scan.Rd
@@ -84,7 +84,7 @@ information, and applying \code{FUN} on these neighborhoods in
 \code{graph.them}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0}{\code{local_scan_0()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0_them}{\code{local_scan_0_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount}{\code{local_scan_1_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount_them}{\code{local_scan_1_ecount_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount}{\code{local_scan_k_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount_them}{\code{local_scan_k_ecount_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_neighborhood_ecount}{\code{local_scan_neighborhood_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0}{\code{local_scan_0}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0_them}{\code{local_scan_0_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount}{\code{local_scan_1_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount_them}{\code{local_scan_1_ecount_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount}{\code{local_scan_k_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount_them}{\code{local_scan_k_ecount_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_neighborhood_ecount}{\code{local_scan_neighborhood_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/make_.Rd b/man/make_.Rd
index 9a6d9536a2d..50c7ccabbf8 100644
--- a/man/make_.Rd
+++ b/man/make_.Rd
@@ -31,7 +31,7 @@ to the newly created graphs.
 See the examples and the various constructor modifiers below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/make_bipartite_graph.Rd b/man/make_bipartite_graph.Rd
index 64680704683..ad7ec485c0f 100644
--- a/man/make_bipartite_graph.Rd
+++ b/man/make_bipartite_graph.Rd
@@ -47,7 +47,7 @@ vertex names; in this case, \code{types} must be a named vector that specifies
 the type for each vertex name that occurs in \code{edges}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_create_bipartite}{\code{create_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_create_bipartite}{\code{create_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/make_chordal_ring.Rd b/man/make_chordal_ring.Rd
index c69ae1dc651..ae716aacfbe 100644
--- a/man/make_chordal_ring.Rd
+++ b/man/make_chordal_ring.Rd
@@ -34,7 +34,7 @@ of total nodes. See also Kotsis, G: Interconnection Topologies for
 Parallel Processing Systems, PARS Mitteilungen 11, 1-6, 1993.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_extended_chordal_ring}{\code{extended_chordal_ring()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_extended_chordal_ring}{\code{extended_chordal_ring}}
 }
 
 \examples{
diff --git a/man/make_circulant.Rd b/man/make_circulant.Rd
index 1f404e150b6..3954bf90c82 100644
--- a/man/make_circulant.Rd
+++ b/man/make_circulant.Rd
@@ -29,7 +29,7 @@ The function can generate either directed or undirected graphs.
 It does not generate multi-edges or self-loops.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_circulant}{\code{circulant()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_circulant}{\code{circulant}}
 }
 
 \examples{
diff --git a/man/make_de_bruijn_graph.Rd b/man/make_de_bruijn_graph.Rd
index 4af4910b84f..f327b6c5512 100644
--- a/man/make_de_bruijn_graph.Rd
+++ b/man/make_de_bruijn_graph.Rd
@@ -36,7 +36,7 @@ De Bruijn graphs have some interesting properties, please see another
 source, e.g. Wikipedia for details.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_de_bruijn}{\code{de_bruijn()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_de_bruijn}{\code{de_bruijn}}
 }
 
 \examples{
diff --git a/man/make_empty_graph.Rd b/man/make_empty_graph.Rd
index 4f4752289ab..5e943824fd5 100644
--- a/man/make_empty_graph.Rd
+++ b/man/make_empty_graph.Rd
@@ -21,7 +21,7 @@ An igraph graph.
 A graph with no edges
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}
 }
 
 \examples{
diff --git a/man/make_from_prufer.Rd b/man/make_from_prufer.Rd
index 2264959805e..8af6600d38b 100644
--- a/man/make_from_prufer.Rd
+++ b/man/make_from_prufer.Rd
@@ -27,7 +27,7 @@ the vertex that it was connected to to the sequence. Repeat until there are
 only two vertices in the remaining graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_from_prufer}{\code{from_prufer()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_from_prufer}{\code{from_prufer}}
 }
 
 \examples{
diff --git a/man/make_full_bipartite_graph.Rd b/man/make_full_bipartite_graph.Rd
index 2accad21ed9..023bb923066 100644
--- a/man/make_full_bipartite_graph.Rd
+++ b/man/make_full_bipartite_graph.Rd
@@ -40,7 +40,7 @@ this is boolean and \code{FALSE} for the vertices of the first kind and
 \code{TRUE} for vertices of the second kind.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_full_bipartite}{\code{full_bipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_full_bipartite}{\code{full_bipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/make_full_citation_graph.Rd b/man/make_full_citation_graph.Rd
index 927baf40719..ccfcac17a15 100644
--- a/man/make_full_citation_graph.Rd
+++ b/man/make_full_citation_graph.Rd
@@ -23,7 +23,7 @@ directed graph, where every \code{i->j} edge is present if and only if
 \eqn{j<i}. If \code{directed=FALSE} then the graph is just a full graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_citation}{\code{full_citation()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_citation}{\code{full_citation}}
 }
 
 \examples{
diff --git a/man/make_full_graph.Rd b/man/make_full_graph.Rd
index 4a592872314..3466991cdfb 100644
--- a/man/make_full_graph.Rd
+++ b/man/make_full_graph.Rd
@@ -23,7 +23,7 @@ An igraph graph
 Create a full graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full}{\code{full()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full}{\code{full}}
 }
 
 \examples{
diff --git a/man/make_full_multipartite.Rd b/man/make_full_multipartite.Rd
index db3634d5448..e6d03bdbe1a 100644
--- a/man/make_full_multipartite.Rd
+++ b/man/make_full_multipartite.Rd
@@ -31,7 +31,7 @@ creates a complete multipartite graph where all possible edges between
 different partitions are present.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_multipartite}{\code{full_multipartite()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_full_multipartite}{\code{full_multipartite}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/make_graph.Rd b/man/make_graph.Rd
index fbf8c6daaaa..86949e2211d 100644
--- a/man/make_graph.Rd
+++ b/man/make_graph.Rd
@@ -217,7 +217,7 @@ Journal of Anthropological Research 33, 452-473 (1977).
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_create}{\code{create}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_famous}{\code{famous}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_empty}{\code{empty}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/make_kautz_graph.Rd b/man/make_kautz_graph.Rd
index 44f70d80bf5..c184b39ebea 100644
--- a/man/make_kautz_graph.Rd
+++ b/man/make_kautz_graph.Rd
@@ -32,7 +32,7 @@ Kautz graphs have some interesting properties, see e.g. Wikipedia for
 details.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kautz}{\code{kautz()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kautz}{\code{kautz}}
 }
 
 \examples{
diff --git a/man/make_lattice.Rd b/man/make_lattice.Rd
index 19d7ca728e2..0433790a541 100644
--- a/man/make_lattice.Rd
+++ b/man/make_lattice.Rd
@@ -61,7 +61,7 @@ forms. In the first form you only supply \code{dimvector}, but not
 \code{dimvector} and supply \code{length} and \code{dim}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_square_lattice}{\code{square_lattice}}
 }
 
 \examples{
diff --git a/man/make_line_graph.Rd b/man/make_line_graph.Rd
index 4e6bc96123c..4d128d09d84 100644
--- a/man/make_line_graph.Rd
+++ b/man/make_line_graph.Rd
@@ -31,7 +31,7 @@ the first vertex's corresponding edge is the same as the source of the
 second vertex's corresponding edge.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_linegraph}{\code{linegraph()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_linegraph}{\code{linegraph}}
 }
 
 \examples{
diff --git a/man/make_ring.Rd b/man/make_ring.Rd
index 57873ee724b..7cf4c1dfafa 100644
--- a/man/make_ring.Rd
+++ b/man/make_ring.Rd
@@ -29,7 +29,7 @@ A ring is a one-dimensional lattice and this function is a special case
 of \code{\link[=make_lattice]{make_lattice()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_ring}{\code{ring()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_ring}{\code{ring}}
 }
 
 \examples{
diff --git a/man/make_star.Rd b/man/make_star.Rd
index 615614afd8f..2b1e3375df1 100644
--- a/man/make_star.Rd
+++ b/man/make_star.Rd
@@ -28,7 +28,7 @@ An igraph graph.
 connected to the center vertex and nobody else.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_star}{\code{star()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_star}{\code{star}}
 }
 
 \examples{
diff --git a/man/make_tree.Rd b/man/make_tree.Rd
index bc150ad6487..b51a4aec54c 100644
--- a/man/make_tree.Rd
+++ b/man/make_tree.Rd
@@ -31,7 +31,7 @@ Create a k-ary tree graph, where almost all vertices other than the leaves
 have the same number of children.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kary_tree}{\code{kary_tree()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_kary_tree}{\code{kary_tree}}
 }
 
 \examples{
diff --git a/man/make_turan.Rd b/man/make_turan.Rd
index 952bc95135e..fdea7584a01 100644
--- a/man/make_turan.Rd
+++ b/man/make_turan.Rd
@@ -31,7 +31,7 @@ returned when the number of vertices is zero. A complete graph is
 returned if the number of partitions is greater than the number of vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_turan}{\code{turan()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_turan}{\code{turan}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/make_wheel.Rd b/man/make_wheel.Rd
index 969dde4f342..3ca8f619692 100644
--- a/man/make_wheel.Rd
+++ b/man/make_wheel.Rd
@@ -39,7 +39,7 @@ two-vertex wheel graph contains a self-loop, while the three-vertex wheel
 graph contains parallel edges (a 1-cycle and a 2-cycle, respectively).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_wheel}{\code{wheel()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_wheel}{\code{wheel}}
 }
 
 \examples{
diff --git a/man/matching.Rd b/man/matching.Rd
index e82d03ab0fa..aca9410679b 100644
--- a/man/matching.Rd
+++ b/man/matching.Rd
@@ -95,7 +95,7 @@ algorithm with greedy initialization and a global relabeling after every
 \eqn{n/2} steps where \eqn{n} is the number of vertices in the graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_matching}{\code{is_matching()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_bipartite_matching}{\code{maximum_bipartite_matching()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_maximal_matching}{\code{is_maximal_matching()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_matching}{\code{is_matching}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_bipartite_matching}{\code{maximum_bipartite_matching}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_maximal_matching}{\code{is_maximal_matching}}
 }
 
 \examples{
diff --git a/man/max_cardinality.Rd b/man/max_cardinality.Rd
index 4e84c5daae1..dff1e59b3ea 100644
--- a/man/max_cardinality.Rd
+++ b/man/max_cardinality.Rd
@@ -37,7 +37,7 @@ The algorithm provides a simple basis for deciding whether a graph is
 chordal, see References below, and also \code{\link[=is_chordal]{is_chordal()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/max_flow.Rd b/man/max_flow.Rd
index ea576eb503d..9e996f21812 100644
--- a/man/max_flow.Rd
+++ b/man/max_flow.Rd
@@ -68,7 +68,7 @@ the flow is the incoming flow of the \code{target} vertex. The maximum flow
 is the flow of maximum value.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_maxflow}{\code{maxflow()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_maxflow}{\code{maxflow}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/maximal.cliques.Rd b/man/maximal.cliques.Rd
index c7977a1be3a..1c820c332df 100644
--- a/man/maximal.cliques.Rd
+++ b/man/maximal.cliques.Rd
@@ -34,7 +34,7 @@ whitespace.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/maximal.cliques.count.Rd b/man/maximal.cliques.count.Rd
index 0966e9781c4..dedce6527d6 100644
--- a/man/maximal.cliques.count.Rd
+++ b/man/maximal.cliques.count.Rd
@@ -28,7 +28,7 @@ parallelize the finding of maximal cliques.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/maximal.independent.vertex.sets.Rd b/man/maximal.independent.vertex.sets.Rd
index 46faf0a6992..7d161b9257c 100644
--- a/man/maximal.independent.vertex.sets.Rd
+++ b/man/maximal.independent.vertex.sets.Rd
@@ -16,7 +16,7 @@ maximal.independent.vertex.sets(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/maximal_ivs.Rd b/man/maximal_ivs.Rd
index 589ea586d54..36c9759c410 100644
--- a/man/maximal_ivs.Rd
+++ b/man/maximal_ivs.Rd
@@ -16,7 +16,7 @@ maximal_ivs(graph)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_maximal_independent_vertex_sets}{\code{maximal_independent_vertex_sets}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/maximum.bipartite.matching.Rd b/man/maximum.bipartite.matching.Rd
index ca6b06fa7ac..75a5994374d 100644
--- a/man/maximum.bipartite.matching.Rd
+++ b/man/maximum.bipartite.matching.Rd
@@ -39,7 +39,7 @@ is ignored.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_bipartite_matching}{\code{maximum_bipartite_matching()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_bipartite_matching}{\code{maximum_bipartite_matching}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/maximum.cardinality.search.Rd b/man/maximum.cardinality.search.Rd
index 2d40599917a..1ce72a87f5e 100644
--- a/man/maximum.cardinality.search.Rd
+++ b/man/maximum.cardinality.search.Rd
@@ -17,7 +17,7 @@ ignored, as the algorithm is defined for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_maximum_cardinality_search}{\code{maximum_cardinality_search}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/merge_coords.Rd b/man/merge_coords.Rd
index 728e32c2127..469c53bc476 100644
--- a/man/merge_coords.Rd
+++ b/man/merge_coords.Rd
@@ -51,7 +51,7 @@ for each component separately. Finally it merges the layouts via calling
 \code{merge_coords()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/min_cut.Rd b/man/min_cut.Rd
index 7e6e7b709a7..96e6ac79422 100644
--- a/man/min_cut.Rd
+++ b/man/min_cut.Rd
@@ -75,7 +75,7 @@ For undirected graphs the Stoer-Wagner algorithm (see reference below) is
 used to calculate the minimum cut.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut}{\code{mincut()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut_value}{\code{mincut_value()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut}{\code{st_mincut()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut_value}{\code{st_mincut_value()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut}{\code{mincut}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_mincut_value}{\code{mincut_value}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut}{\code{st_mincut}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_mincut_value}{\code{st_mincut_value}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/min_separators.Rd b/man/min_separators.Rd
index 9b96c377a49..f65444fdb14 100644
--- a/man/min_separators.Rd
+++ b/man/min_separators.Rd
@@ -27,7 +27,7 @@ In the special case of a fully connected input graph with \eqn{n} vertices,
 all subsets of size \eqn{n-1} are listed as the result.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/min_st_separators.Rd b/man/min_st_separators.Rd
index f21832e938c..74b7cd12aa5 100644
--- a/man/min_st_separators.Rd
+++ b/man/min_st_separators.Rd
@@ -52,7 +52,7 @@ min_st_separators(g)
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/minimal.st.separators.Rd b/man/minimal.st.separators.Rd
index ce68851dee0..a0b14bc1355 100644
--- a/man/minimal.st.separators.Rd
+++ b/man/minimal.st.separators.Rd
@@ -17,7 +17,7 @@ ignored.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_all_minimal_st_separators}{\code{all_minimal_st_separators}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/minimum.size.separators.Rd b/man/minimum.size.separators.Rd
index 18aad1738e5..00ac97e7c68 100644
--- a/man/minimum.size.separators.Rd
+++ b/man/minimum.size.separators.Rd
@@ -17,7 +17,7 @@ ignored.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Separators.html#igraph_minimum_size_separators}{\code{minimum_size_separators}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/minimum.spanning.tree.Rd b/man/minimum.spanning.tree.Rd
index 768d53da1db..26ca057e603 100644
--- a/man/minimum.spanning.tree.Rd
+++ b/man/minimum.spanning.tree.Rd
@@ -30,7 +30,7 @@ algorithm is chosen, otherwise the unweighted algorithm is used.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_unweighted}{\code{minimum_spanning_tree_unweighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_prim}{\code{minimum_spanning_tree_prim()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_unweighted}{\code{minimum_spanning_tree_unweighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_prim}{\code{minimum_spanning_tree_prim}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/mod.matrix.Rd b/man/mod.matrix.Rd
index d14a9ef9a56..d2763265d13 100644
--- a/man/mod.matrix.Rd
+++ b/man/mod.matrix.Rd
@@ -25,7 +25,7 @@ modularity. Ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity_matrix}{\code{modularity_matrix()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity_matrix}{\code{modularity_matrix}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/modularity.igraph.Rd b/man/modularity.igraph.Rd
index e95ba7cb2a9..1fda229f5c2 100644
--- a/man/modularity.igraph.Rd
+++ b/man/modularity.igraph.Rd
@@ -84,7 +84,7 @@ and \eqn{m} is the number of edges (or the total weights in the graph, if it
 is weighed).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity}{\code{modularity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity_matrix}{\code{modularity_matrix()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity}{\code{modularity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_modularity_matrix}{\code{modularity_matrix}}
 }
 
 \examples{
diff --git a/man/motifs.Rd b/man/motifs.Rd
index 8fb895fd0b4..7c9b3965882 100644
--- a/man/motifs.Rd
+++ b/man/motifs.Rd
@@ -49,7 +49,7 @@ the motifs is defined by their isomorphism class, see
 \code{\link[=isomorphism_class]{isomorphism_class()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu}{\code{motifs_randesu()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_callback}{\code{motifs_randesu_callback_closure()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu}{\code{motifs_randesu}}, \href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_callback}{\code{motifs_randesu_callback_closure()}}
 }
 
 \examples{
diff --git a/man/mst.Rd b/man/mst.Rd
index e8c7298d401..1751633a61b 100644
--- a/man/mst.Rd
+++ b/man/mst.Rd
@@ -42,7 +42,7 @@ of minimum spanning trees of all of its components.
 If the graph is not connected a minimum spanning forest is returned.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_unweighted}{\code{minimum_spanning_tree_unweighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_prim}{\code{minimum_spanning_tree_prim()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_unweighted}{\code{minimum_spanning_tree_unweighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_minimum_spanning_tree_prim}{\code{minimum_spanning_tree_prim}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/multilevel.community.Rd b/man/multilevel.community.Rd
index 0b44412feba..01ceefa917f 100644
--- a/man/multilevel.community.Rd
+++ b/man/multilevel.community.Rd
@@ -30,7 +30,7 @@ is set to 1.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_multilevel}{\code{community_multilevel()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_multilevel}{\code{community_multilevel}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/neighborhood.size.Rd b/man/neighborhood.size.Rd
index f4d6722866c..d178d6cbff8 100644
--- a/man/neighborhood.size.Rd
+++ b/man/neighborhood.size.Rd
@@ -37,7 +37,7 @@ argument is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/neighbors.Rd b/man/neighbors.Rd
index 1ed69da1c2b..a89e4b10152 100644
--- a/man/neighbors.Rd
+++ b/man/neighbors.Rd
@@ -23,7 +23,7 @@ A vertex is a neighbor of another one (in other words, the two
 vertices are adjacent), if they are incident to the same edge.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_neighbors}{\code{neighbors()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_neighbors}{\code{neighbors}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/optimal.community.Rd b/man/optimal.community.Rd
index 625fcc65873..0157437387c 100644
--- a/man/optimal.community.Rd
+++ b/man/optimal.community.Rd
@@ -24,7 +24,7 @@ edge weight means a stronger connection for this function.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_optimal_modularity}{\code{community_optimal_modularity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_community_optimal_modularity}{\code{community_optimal_modularity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/page.rank.Rd b/man/page.rank.Rd
index ad32dc1ed64..1b00d818d79 100644
--- a/man/page.rank.Rd
+++ b/man/page.rank.Rd
@@ -61,7 +61,7 @@ implementation is used.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/page_rank.Rd b/man/page_rank.Rd
index a7f041459b7..46a58233dd0 100644
--- a/man/page_rank.Rd
+++ b/man/page_rank.Rd
@@ -90,7 +90,7 @@ PageRank for only some of the vertices does not result in any performance
 increase at all.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_personalized_pagerank}{\code{personalized_pagerank}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/path.length.hist.Rd b/man/path.length.hist.Rd
index cf2ebf9912e..021d990df23 100644
--- a/man/path.length.hist.Rd
+++ b/man/path.length.hist.Rd
@@ -19,7 +19,7 @@ this argument is ignored for undirected graphs.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_path_length_hist}{\code{path_length_hist}}
 }
 
 \keyword{internal}
diff --git a/man/permute.Rd b/man/permute.Rd
index d2939a2ae14..d049c0efecd 100644
--- a/man/permute.Rd
+++ b/man/permute.Rd
@@ -28,7 +28,7 @@ of a graph.
 \code{permute()} keeps all graph, vertex and edge attributes of the graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}
 }
 
 \examples{
diff --git a/man/permute.vertices.Rd b/man/permute.vertices.Rd
index 7e5430d988a..58003d79825 100644
--- a/man/permute.vertices.Rd
+++ b/man/permute.vertices.Rd
@@ -20,7 +20,7 @@ first element is the new id of vertex 1, etc. Every number between one and
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}
 }
 
 \keyword{internal}
diff --git a/man/piecewise.layout.Rd b/man/piecewise.layout.Rd
index 50ca54cc9e3..76a70832171 100644
--- a/man/piecewise.layout.Rd
+++ b/man/piecewise.layout.Rd
@@ -21,7 +21,7 @@ function.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_decompose}{\code{decompose}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/plot.igraph.Rd b/man/plot.igraph.Rd
index 30f2aef1039..7a91dea520e 100644
--- a/man/plot.igraph.Rd
+++ b/man/plot.igraph.Rd
@@ -85,7 +85,7 @@ first, handtune the placement of the vertices, query the coordinates by the
 plot the graph to any R device.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_incident}{\code{incident()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_incident}{\code{incident}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_convex_hull_2d}{\code{convex_hull_2d}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/plotHierarchy.Rd b/man/plotHierarchy.Rd
index 9ed29941302..1f91911b82c 100644
--- a/man/plotHierarchy.Rd
+++ b/man/plotHierarchy.Rd
@@ -25,7 +25,7 @@ them to \code{plot.igraph()}.  \code{\link[=print]{print()}} and \code{\link[=su
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/power_centrality.Rd b/man/power_centrality.Rd
index 50471911a06..cb9162ad677 100644
--- a/man/power_centrality.Rd
+++ b/man/power_centrality.Rd
@@ -103,7 +103,7 @@ fixed when we get a better algorithm.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/predict_edges.Rd b/man/predict_edges.Rd
index 1fcc1a1dae5..bd1713c14c3 100644
--- a/man/predict_edges.Rd
+++ b/man/predict_edges.Rd
@@ -53,7 +53,7 @@ argument is set to \code{TRUE}. Otherwise a HRG is fitted to the graph
 first.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_predict}{\code{hrg_predict()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_predict}{\code{hrg_predict}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/preference.game.Rd b/man/preference.game.Rd
index 08a72291ebc..920b3ac464e 100644
--- a/man/preference.game.Rd
+++ b/man/preference.game.Rd
@@ -42,7 +42,7 @@ an undirected graph, it must be symmetric.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_preference_game}{\code{preference_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_preference_game}{\code{preference_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/print.igraph.Rd b/man/print.igraph.Rd
index 286ef6bd9a0..612abf661c1 100644
--- a/man/print.igraph.Rd
+++ b/man/print.igraph.Rd
@@ -102,7 +102,7 @@ As of igraph 1.1.1, the \code{str.igraph} function is defunct, use
 \code{print_all()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_degree}{\code{degree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/print.igraph.es.Rd b/man/print.igraph.es.Rd
index 54dad6f1420..ccca519ab7f 100644
--- a/man/print.igraph.es.Rd
+++ b/man/print.igraph.es.Rd
@@ -30,7 +30,7 @@ differently, together with all attributes of the edges in the sequence,
 as a table.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/print.igraph.vs.Rd b/man/print.igraph.vs.Rd
index 9ea92cfad06..8ebea3a0148 100644
--- a/man/print.igraph.vs.Rd
+++ b/man/print.igraph.vs.Rd
@@ -30,7 +30,7 @@ printed differently, together with all attributes of the vertices
 in the sequence, as a table.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/radius.Rd b/man/radius.Rd
index a4438dac168..1ca90bbf2ed 100644
--- a/man/radius.Rd
+++ b/man/radius.Rd
@@ -40,7 +40,7 @@ This implementation ignores vertex pairs that are in different
 components. Isolated vertices have eccentricity zero.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_radius_dijkstra}{\code{radius_dijkstra()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_radius_dijkstra}{\code{radius_dijkstra}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/random_walk.Rd b/man/random_walk.Rd
index 5232e145b23..271bc801419 100644
--- a/man/random_walk.Rd
+++ b/man/random_walk.Rd
@@ -66,7 +66,7 @@ and returned a sequence of length \code{steps} instead of \code{steps + 1}.
 This has changed to improve consistency with the underlying C library.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Visitors.html#igraph_random_walk}{\code{random_walk()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Visitors.html#igraph_random_walk}{\code{random_walk}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/read.graph.Rd b/man/read.graph.Rd
index 98e50a3d354..1aceaaa24db 100644
--- a/man/read.graph.Rd
+++ b/man/read.graph.Rd
@@ -31,7 +31,7 @@ insensitive.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/read_graph.Rd b/man/read_graph.Rd
index 25b46d7eae4..b2a405cb407 100644
--- a/man/read_graph.Rd
+++ b/man/read_graph.Rd
@@ -184,7 +184,7 @@ This is a binary format, used in the ARG Graph Database for isomorphism testing.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_pajek}{\code{read_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphml}{\code{read_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_gml}{\code{read_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_dl}{\code{read_graph_dl}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_read_graph_graphdb}{\code{read_graph_graphdb}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/realize_bipartite_degseq.Rd b/man/realize_bipartite_degseq.Rd
index 6bc53424966..3da207f2e7c 100644
--- a/man/realize_bipartite_degseq.Rd
+++ b/man/realize_bipartite_degseq.Rd
@@ -53,7 +53,7 @@ assortativity, and is often disconnected.
 The \dQuote{index} method selects the vertices in order of their index.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{realize_bipartite_degree_sequence()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_realize_bipartite_degree_sequence}{\code{realize_bipartite_degree_sequence}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/realize_degseq.Rd b/man/realize_degseq.Rd
index 06b67197728..ba1aef85f8e 100644
--- a/man/realize_degseq.Rd
+++ b/man/realize_degseq.Rd
@@ -61,7 +61,7 @@ and is often disconnected.
 The \dQuote{index} method selects the vertices in order of their index.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_realize_degree_sequence}{\code{realize_degree_sequence()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_realize_degree_sequence}{\code{realize_degree_sequence}}
 }
 
 \examples{
diff --git a/man/reciprocity.Rd b/man/reciprocity.Rd
index 251c7d61086..239b1fa1961 100644
--- a/man/reciprocity.Rd
+++ b/man/reciprocity.Rd
@@ -36,7 +36,7 @@ The result is the size of group (3), divided by the sum of group sizes
 (2)+(3). This measure is calculated if \code{mode} is \code{ratio}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_reciprocity}{\code{reciprocity()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_reciprocity}{\code{reciprocity}}
 }
 
 \examples{
diff --git a/man/rep.igraph.Rd b/man/rep.igraph.Rd
index 326d2062fc7..23091acc989 100644
--- a/man/rep.igraph.Rd
+++ b/man/rep.igraph.Rd
@@ -26,7 +26,7 @@ The new graph will contain the input graph the given number
 of times, as unconnected components.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/reverse_edges.Rd b/man/reverse_edges.Rd
index c12ee55c343..0e4af07baf2 100644
--- a/man/reverse_edges.Rd
+++ b/man/reverse_edges.Rd
@@ -27,7 +27,7 @@ their edge IDs in the \code{eids} argument will be reversed. When reversing
 all edges, this operation is also known as graph transpose.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_reverse_edges}{\code{reverse_edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_reverse_edges}{\code{reverse_edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/rglplot.Rd b/man/rglplot.Rd
index ee49bd71b19..04e075bd07a 100644
--- a/man/rglplot.Rd
+++ b/man/rglplot.Rd
@@ -27,7 +27,7 @@ very useful either. See \link{igraph.plotting} for the possible
 arguments.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/running.mean.Rd b/man/running.mean.Rd
index 9a18f326170..a5701125b5b 100644
--- a/man/running.mean.Rd
+++ b/man/running.mean.Rd
@@ -19,7 +19,7 @@ i.e. smaller than the length of \code{v}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_running_mean}{\code{running_mean()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_running_mean}{\code{running_mean}}
 }
 
 \keyword{internal}
diff --git a/man/running_mean.Rd b/man/running_mean.Rd
index 1cb94231714..b873b6925a6 100644
--- a/man/running_mean.Rd
+++ b/man/running_mean.Rd
@@ -26,7 +26,7 @@ the first \code{binwidth} elements of \code{v}, the second element of
 \code{w} is the average of elements \code{2:(binwidth+1)}, etc.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_running_mean}{\code{running_mean()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_running_mean}{\code{running_mean}}
 }
 
 \examples{
diff --git a/man/sample_.Rd b/man/sample_.Rd
index 9476a2109e3..3e7b346c9dd 100644
--- a/man/sample_.Rd
+++ b/man/sample_.Rd
@@ -31,7 +31,7 @@ to the newly created graphs.
 See the examples and the various constructor modifiers below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/sample_bipartite.Rd b/man/sample_bipartite.Rd
index 288b2c5c770..823037e1281 100644
--- a/man/sample_bipartite.Rd
+++ b/man/sample_bipartite.Rd
@@ -52,7 +52,7 @@ A bipartite igraph graph.
 Use \code{\link[=sample_bipartite_gnm]{sample_bipartite_gnm()}} and \code{\link[=sample_bipartite_gnp]{sample_bipartite_gnp()}} instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/sample_bipartite_gnm.Rd b/man/sample_bipartite_gnm.Rd
index b611978d4a8..0d76f9879f4 100644
--- a/man/sample_bipartite_gnm.Rd
+++ b/man/sample_bipartite_gnm.Rd
@@ -62,7 +62,7 @@ with probability \eqn{p}, independently of the rest of the edges. In \eqn{G(n,m)
 uniformly choose \eqn{m} edges to realize.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnm}{\code{bipartite_game_gnm}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Bipartite.html#igraph_bipartite_game_gnp}{\code{bipartite_game_gnp}}
 }
 
 \examples{
diff --git a/man/sample_chung_lu.Rd b/man/sample_chung_lu.Rd
index 724ac89bc20..0bef88fb16b 100644
--- a/man/sample_chung_lu.Rd
+++ b/man/sample_chung_lu.Rd
@@ -127,7 +127,7 @@ variants, see Section 16.4 of Bollobás, Janson, Riordan (2007), as well as
 Van Der Hofstad (2013).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_chung_lu_game}{\code{chung_lu_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_chung_lu_game}{\code{chung_lu_game}}
 }
 
 \examples{
diff --git a/man/sample_correlated_gnp.Rd b/man/sample_correlated_gnp.Rd
index 527a20cb067..710658a01ae 100644
--- a/man/sample_correlated_gnp.Rd
+++ b/man/sample_correlated_gnp.Rd
@@ -43,7 +43,7 @@ and shuffling its vertices.
 Please see the reference given below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_correlated_game}{\code{correlated_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_correlated_game}{\code{correlated_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_density}{\code{density}}
 }
 
 \examples{
diff --git a/man/sample_correlated_gnp_pair.Rd b/man/sample_correlated_gnp_pair.Rd
index e701d8eb34e..3be9884ad3c 100644
--- a/man/sample_correlated_gnp_pair.Rd
+++ b/man/sample_correlated_gnp_pair.Rd
@@ -35,7 +35,7 @@ shuffling its vertices.
 Please see the reference given below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_correlated_pair_game}{\code{correlated_pair_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_correlated_pair_game}{\code{correlated_pair_game}}
 }
 
 \examples{
diff --git a/man/sample_degseq.Rd b/man/sample_degseq.Rd
index ecd7821db22..4a3b886b218 100644
--- a/man/sample_degseq.Rd
+++ b/man/sample_degseq.Rd
@@ -82,7 +82,7 @@ The \dQuote{edge.switching.simple} is an MCMC sampler based on
 degree-preserving edge switches. It generates simple undirected or directed graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_degree_sequence_game}{\code{degree_sequence_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_degree_sequence_game}{\code{degree_sequence_game}}
 }
 
 \examples{
diff --git a/man/sample_dirichlet.Rd b/man/sample_dirichlet.Rd
index 677ea07bc78..ea147fe640f 100644
--- a/man/sample_dirichlet.Rd
+++ b/man/sample_dirichlet.Rd
@@ -27,7 +27,7 @@ with given \eqn{\alpha}{alpha} parameter. The sample is drawn from
 \code{length(alpha)-1}-simplex.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_dirichlet}{\code{sample_dirichlet()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_dirichlet}{\code{sample_dirichlet}}
 }
 
 \examples{
diff --git a/man/sample_dot_product.Rd b/man/sample_dot_product.Rd
index 667fc43de01..42eab6ff5d4 100644
--- a/man/sample_dot_product.Rd
+++ b/man/sample_dot_product.Rd
@@ -31,7 +31,7 @@ interval, otherwise a warning is given. For negative dot products, no edges
 are added; dot products that are larger than one always add an edge.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_dot_product_game}{\code{dot_product_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_dot_product_game}{\code{dot_product_game}}
 }
 
 \examples{
diff --git a/man/sample_fitness.Rd b/man/sample_fitness.Rd
index 60d30307b6d..e1fed7df5a3 100644
--- a/man/sample_fitness.Rd
+++ b/man/sample_fitness.Rd
@@ -66,7 +66,7 @@ distribution. Alternatively, you may use \code{\link[=sample_fitness_pl]{sample_
 which generates the fitnesses for you with a given exponent.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game}}
 }
 
 \examples{
diff --git a/man/sample_fitness_pl.Rd b/man/sample_fitness_pl.Rd
index a45f84d9437..a2bb173f670 100644
--- a/man/sample_fitness_pl.Rd
+++ b/man/sample_fitness_pl.Rd
@@ -69,7 +69,7 @@ the square root of the number of edges times the average degree; see the
 paper of Chung and Lu, and Cho et al for more details.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game}}
 }
 
 \examples{
diff --git a/man/sample_forestfire.Rd b/man/sample_forestfire.Rd
index c4e4b9fc76f..294fe1bc0d1 100644
--- a/man/sample_forestfire.Rd
+++ b/man/sample_forestfire.Rd
@@ -54,7 +54,7 @@ corrected version is available from
 implementation is based on this.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_forest_fire_game}{\code{forest_fire_game}}
 }
 
 \examples{
diff --git a/man/sample_gnm.Rd b/man/sample_gnm.Rd
index e0fe872dee9..e37a0fc9430 100644
--- a/man/sample_gnm.Rd
+++ b/man/sample_gnm.Rd
@@ -31,7 +31,7 @@ at random from the set of all vertex pairs. This set includes potential
 self-connections as well if the \code{loops} parameter is \code{TRUE}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnm}{\code{erdos_renyi_game_gnm()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnm}{\code{erdos_renyi_game_gnm}}
 }
 
 \examples{
diff --git a/man/sample_gnp.Rd b/man/sample_gnp.Rd
index 22f72e0f26b..3b17936dba2 100644
--- a/man/sample_gnp.Rd
+++ b/man/sample_gnp.Rd
@@ -37,7 +37,7 @@ is the largest possible number of edges, which depends on whether the
 graph is directed or undirected and whether self-loops are allowed.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnp}{\code{erdos_renyi_game_gnp()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_erdos_renyi_game_gnp}{\code{erdos_renyi_game_gnp}}
 }
 
 \examples{
diff --git a/man/sample_grg.Rd b/man/sample_grg.Rd
index 9335720e240..02a745e654d 100644
--- a/man/sample_grg.Rd
+++ b/man/sample_grg.Rd
@@ -36,7 +36,7 @@ Euclidean norm than a given radius. If the \code{torus} argument is
 \code{TRUE} then a unit area torus is used instead of a square.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/sample_growing.Rd b/man/sample_growing.Rd
index bb8fceeac09..b34631fac8e 100644
--- a/man/sample_growing.Rd
+++ b/man/sample_growing.Rd
@@ -35,7 +35,7 @@ vertices, otherwise the edges are connecting new vertex to uniformly
 randomly chosen old vertices.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_growing_random_game}{\code{growing_random_game}}
 }
 
 \examples{
diff --git a/man/sample_hierarchical_sbm.Rd b/man/sample_hierarchical_sbm.Rd
index a1d153d0ed2..c062c826859 100644
--- a/man/sample_hierarchical_sbm.Rd
+++ b/man/sample_hierarchical_sbm.Rd
@@ -40,7 +40,7 @@ The function generates a random graph according to the hierarchical
 stochastic block model.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_hsbm_game}{\code{hsbm_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_hsbm_list_game}{\code{hsbm_list_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_hsbm_game}{\code{hsbm_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_hsbm_list_game}{\code{hsbm_list_game}}
 }
 
 \examples{
diff --git a/man/sample_hrg.Rd b/man/sample_hrg.Rd
index ae836b9db16..bc53f7d6d04 100644
--- a/man/sample_hrg.Rd
+++ b/man/sample_hrg.Rd
@@ -17,7 +17,7 @@ An igraph graph.
 model.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-HRG.html#igraph_hrg_game}{\code{hrg_game}}
 }
 
 \seealso{
diff --git a/man/sample_islands.Rd b/man/sample_islands.Rd
index 9e8e80376bc..1a449b9a39d 100644
--- a/man/sample_islands.Rd
+++ b/man/sample_islands.Rd
@@ -33,7 +33,7 @@ oc
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_simple_interconnected_islands_game}{\code{simple_interconnected_islands_game}}
 }
 
 \seealso{
diff --git a/man/sample_k_regular.Rd b/man/sample_k_regular.Rd
index 8debbd8115b..ac232426f5f 100644
--- a/man/sample_k_regular.Rd
+++ b/man/sample_k_regular.Rd
@@ -32,7 +32,7 @@ The game simply uses \code{\link[=sample_degseq]{sample_degseq()}} with appropri
 constructed degree sequences.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_k_regular_game}{\code{k_regular_game}}
 }
 
 \examples{
diff --git a/man/sample_last_cit.Rd b/man/sample_last_cit.Rd
index 1ababc5c67e..0bd733bb99b 100644
--- a/man/sample_last_cit.Rd
+++ b/man/sample_last_cit.Rd
@@ -97,7 +97,7 @@ but the probability of an edge depends on the (potentially) cited
 vertex only.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lastcit_game}{\code{lastcit_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_cited_type_game}{\code{cited_type_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_citing_cited_type_game}{\code{citing_cited_type_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_lastcit_game}{\code{lastcit_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_cited_type_game}{\code{cited_type_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_citing_cited_type_game}{\code{citing_cited_type_game}}
 }
 
 \seealso{
diff --git a/man/sample_motifs.Rd b/man/sample_motifs.Rd
index 97449304353..c753a32a043 100644
--- a/man/sample_motifs.Rd
+++ b/man/sample_motifs.Rd
@@ -43,7 +43,7 @@ structure.  These functions search a graph for various motifs.
 size in a graph based on a sample.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_estimate}{\code{motifs_randesu_estimate()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_motifs_randesu_estimate}{\code{motifs_randesu_estimate}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/sample_pa.Rd b/man/sample_pa.Rd
index d6a7a6b8494..f025862b54c 100644
--- a/man/sample_pa.Rd
+++ b/man/sample_pa.Rd
@@ -123,7 +123,7 @@ of adjacent edges not initiated by the vertex itself and not the total
 \code{TRUE}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_game}{\code{barabasi_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/sample_pa_age.Rd b/man/sample_pa_age.Rd
index 51bbd3daef9..2807905c050 100644
--- a/man/sample_pa_age.Rd
+++ b/man/sample_pa_age.Rd
@@ -138,7 +138,7 @@ If the \code{time.window} argument is given (and not NULL) then
 This function might generate graphs with multiple edges.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_barabasi_aging_game}{\code{barabasi_aging_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_recent_degree_aging_game}{\code{recent_degree_aging_game}}
 }
 
 \examples{
diff --git a/man/sample_pref.Rd b/man/sample_pref.Rd
index 98b2b2191e9..27ab6b88fc2 100644
--- a/man/sample_pref.Rd
+++ b/man/sample_pref.Rd
@@ -93,7 +93,7 @@ The types of the generated vertices can be retrieved from the
 \code{intype} and \code{outtype} vertex attribute for \code{sample_asym_pref()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_preference_game}{\code{preference_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_asymmetric_preference_game}{\code{asymmetric_preference_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_preference_game}{\code{preference_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_asymmetric_preference_game}{\code{asymmetric_preference_game}}
 }
 
 \examples{
diff --git a/man/sample_sbm.Rd b/man/sample_sbm.Rd
index eacaa1753db..b5665436cb0 100644
--- a/man/sample_sbm.Rd
+++ b/man/sample_sbm.Rd
@@ -39,7 +39,7 @@ The order of the vertices in the generated graph corresponds to the
 \code{block.sizes} argument.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game}}
 }
 
 \examples{
diff --git a/man/sample_seq.Rd b/man/sample_seq.Rd
index 567d7f5d136..ebc3488687c 100644
--- a/man/sample_seq.Rd
+++ b/man/sample_seq.Rd
@@ -26,7 +26,7 @@ The algorithm runs in \code{O(length)} expected time, even if
 the builtin \code{sample} function of R.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_random_sample}{\code{random_sample()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_random_sample}{\code{random_sample}}
 }
 
 \examples{
diff --git a/man/sample_smallworld.Rd b/man/sample_smallworld.Rd
index 52aa597c63e..5aaf562425d 100644
--- a/man/sample_smallworld.Rd
+++ b/man/sample_smallworld.Rd
@@ -49,7 +49,7 @@ For appropriate choices of \code{p}, both models exhibit the property of
 simultaneously having short path lengths and high clustering.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_watts_strogatz_game}{\code{watts_strogatz_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_watts_strogatz_game}{\code{watts_strogatz_game}}
 }
 
 \examples{
diff --git a/man/sample_spanning_tree.Rd b/man/sample_spanning_tree.Rd
index b1895bde0cc..4c5efa3fe3e 100644
--- a/man/sample_spanning_tree.Rd
+++ b/man/sample_spanning_tree.Rd
@@ -26,7 +26,7 @@ An edge sequence containing the edges of the spanning tree. Use
 randomly and uniformly, using loop-erased random walks.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_random_spanning_tree}{\code{random_spanning_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_random_spanning_tree}{\code{random_spanning_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}
 }
 
 \examples{
diff --git a/man/sample_sphere_surface.Rd b/man/sample_sphere_surface.Rd
index 4fbc0f7269b..babe6eaeb80 100644
--- a/man/sample_sphere_surface.Rd
+++ b/man/sample_sphere_surface.Rd
@@ -31,7 +31,7 @@ random dot product graphs
 norm of the samples equal \code{radius}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_sphere_surface}{\code{sample_sphere_surface()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_sphere_surface}{\code{sample_sphere_surface}}
 }
 
 \examples{
diff --git a/man/sample_sphere_volume.Rd b/man/sample_sphere_volume.Rd
index 6c3b4446a2c..b6c1173e76b 100644
--- a/man/sample_sphere_volume.Rd
+++ b/man/sample_sphere_volume.Rd
@@ -31,7 +31,7 @@ random dot product graphs
 smaller or equal to \code{radius}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_sphere_volume}{\code{sample_sphere_volume()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Nongraph.html#igraph_sample_sphere_volume}{\code{sample_sphere_volume}}
 }
 
 \examples{
diff --git a/man/sample_traits_callaway.Rd b/man/sample_traits_callaway.Rd
index 63acbb8db8f..4ada6d44597 100644
--- a/man/sample_traits_callaway.Rd
+++ b/man/sample_traits_callaway.Rd
@@ -83,7 +83,7 @@ depends on the types of the vertices involved and is taken from
 \code{pref.matrix}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_callaway_traits_game}{\code{callaway_traits_game()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_establishment_game}{\code{establishment_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_callaway_traits_game}{\code{callaway_traits_game}}, \href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_establishment_game}{\code{establishment_game}}
 }
 
 \examples{
diff --git a/man/sample_tree.Rd b/man/sample_tree.Rd
index 2e693022e66..a27b6563464 100644
--- a/man/sample_tree.Rd
+++ b/man/sample_tree.Rd
@@ -31,7 +31,7 @@ In other words, the function generates each possible labelled tree with the
 given number of nodes with the same probability.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_tree_game}{\code{tree_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_tree_game}{\code{tree_game}}
 }
 
 \examples{
diff --git a/man/sbm.game.Rd b/man/sbm.game.Rd
index 425139bbc01..cb34e4c0b97 100644
--- a/man/sbm.game.Rd
+++ b/man/sbm.game.Rd
@@ -29,7 +29,7 @@ group. The sum of the vector must match the number of vertices.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_sbm_game}{\code{sbm_game}}
 }
 
 \keyword{internal}
diff --git a/man/scan_stat.Rd b/man/scan_stat.Rd
index 126b52fd7a1..841972117ed 100644
--- a/man/scan_stat.Rd
+++ b/man/scan_stat.Rd
@@ -45,7 +45,7 @@ each graph and each vertex, and then normalizing across the
 vertices and across the time steps.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0}{\code{local_scan_0()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0_them}{\code{local_scan_0_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount}{\code{local_scan_1_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount_them}{\code{local_scan_1_ecount_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount}{\code{local_scan_k_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount_them}{\code{local_scan_k_ecount_them()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_neighborhood_ecount}{\code{local_scan_neighborhood_ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0}{\code{local_scan_0}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_0_them}{\code{local_scan_0_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount}{\code{local_scan_1_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_1_ecount_them}{\code{local_scan_1_ecount_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount}{\code{local_scan_k_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_k_ecount_them}{\code{local_scan_k_ecount_them}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_local_scan_neighborhood_ecount}{\code{local_scan_neighborhood_ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/set.edge.attribute.Rd b/man/set.edge.attribute.Rd
index 71dd0b2101e..059b860742a 100644
--- a/man/set.edge.attribute.Rd
+++ b/man/set.edge.attribute.Rd
@@ -25,7 +25,7 @@ If \code{NULL}, the input is returned unchanged.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/set.vertex.attribute.Rd b/man/set.vertex.attribute.Rd
index 98702f4feca..6121e6f2483 100644
--- a/man/set.vertex.attribute.Rd
+++ b/man/set.vertex.attribute.Rd
@@ -25,7 +25,7 @@ If \code{NULL}, the input is returned unchanged.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/set_edge_attr.Rd b/man/set_edge_attr.Rd
index 5368e067dd5..6b2c46e5ec5 100644
--- a/man/set_edge_attr.Rd
+++ b/man/set_edge_attr.Rd
@@ -25,7 +25,7 @@ The graph, with the edge attribute added or set.
 Set edge attributes
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/set_vertex_attr.Rd b/man/set_vertex_attr.Rd
index 7d4f2726a9a..cb63c4209e0 100644
--- a/man/set_vertex_attr.Rd
+++ b/man/set_vertex_attr.Rd
@@ -25,7 +25,7 @@ The graph, with the vertex attribute added or set.
 Set vertex attributes
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/set_vertex_attrs.Rd b/man/set_vertex_attrs.Rd
index 30acb17339c..df41c7c7ee8 100644
--- a/man/set_vertex_attrs.Rd
+++ b/man/set_vertex_attrs.Rd
@@ -21,7 +21,7 @@ The graph, with the vertex attributes added or set.
 Set multiple vertex attributes
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/shortest.paths.Rd b/man/shortest.paths.Rd
index 0fc77c78065..e208f46f98d 100644
--- a/man/shortest.paths.Rd
+++ b/man/shortest.paths.Rd
@@ -55,7 +55,7 @@ used, regardless of this argument.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/similarity.Rd b/man/similarity.Rd
index bf923a81335..29edbe53473 100644
--- a/man/similarity.Rd
+++ b/man/similarity.Rd
@@ -58,7 +58,7 @@ Eytan Adar: Friends and neighbors on the Web. Social Networks,
 25(3):211-230, 2003.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/similarity.dice.Rd b/man/similarity.dice.Rd
index d0846761305..8162c710fcf 100644
--- a/man/similarity.dice.Rd
+++ b/man/similarity.dice.Rd
@@ -29,7 +29,7 @@ sets.}
 Please use \code{\link[=similarity]{similarity()}} with \code{method = "dice"} instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/similarity.invlogweighted.Rd b/man/similarity.invlogweighted.Rd
index 19a2cd9afe9..5bf119e9219 100644
--- a/man/similarity.invlogweighted.Rd
+++ b/man/similarity.invlogweighted.Rd
@@ -25,7 +25,7 @@ possible values: \sQuote{\code{out}}, \sQuote{\verb{in}},
 Please use \code{\link[=similarity]{similarity()}} with \code{method = "invlogweighted"} instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/similarity.jaccard.Rd b/man/similarity.jaccard.Rd
index 9b0f11b9062..7e62e1eb1c5 100644
--- a/man/similarity.jaccard.Rd
+++ b/man/similarity.jaccard.Rd
@@ -29,7 +29,7 @@ sets.}
 Please use \code{\link[=similarity]{similarity()}} with \code{method = "jaccard"} instead.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_dice}{\code{similarity_dice}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_inverse_log_weighted}{\code{similarity_inverse_log_weighted}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_similarity_jaccard}{\code{similarity_jaccard}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/simple_cycles.Rd b/man/simple_cycles.Rd
index 1a1aba8eb7a..9a122e6a07b 100644
--- a/man/simple_cycles.Rd
+++ b/man/simple_cycles.Rd
@@ -59,7 +59,7 @@ have exponentially many cycles and the presence of multi-edges exacerbates
 this combinatorial explosion.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_simple_cycles}{\code{simple_cycles()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cycles.html#igraph_simple_cycles}{\code{simple_cycles}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/simplify.Rd b/man/simplify.Rd
index 496c38c893c..9d4f6e70ac2 100644
--- a/man/simplify.Rd
+++ b/man/simplify.Rd
@@ -59,7 +59,7 @@ the original graph are discarded as the primary purpose of this function is
 to facilitate the usage of multigraphs with the VF2 algorithm.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_simple}{\code{is_simple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_simplify_and_colorize}{\code{simplify_and_colorize()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_simplify}{\code{simplify}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_simple}{\code{is_simple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_simplify_and_colorize}{\code{simplify_and_colorize}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/sir.Rd b/man/sir.Rd
index f2f81e2f437..fe23e2855c0 100644
--- a/man/sir.Rd
+++ b/man/sir.Rd
@@ -105,7 +105,7 @@ quantiles of the results, respectively, in bins calculated with
 \code{time_bins()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Spatial-Games.html#igraph_sir}{\code{sir()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Spatial-Games.html#igraph_sir}{\code{sir}}
 }
 
 \examples{
diff --git a/man/spinglass.community.Rd b/man/spinglass.community.Rd
index 24969137b61..de4dad44dbb 100644
--- a/man/spinglass.community.Rd
+++ b/man/spinglass.community.Rd
@@ -91,7 +91,7 @@ is ignored if the \sQuote{orig} implementation is chosen.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/split_join_distance.Rd b/man/split_join_distance.Rd
index ee9ca23a356..24731a89559 100644
--- a/man/split_join_distance.Rd
+++ b/man/split_join_distance.Rd
@@ -36,7 +36,7 @@ partition is a subpartition of the other, since in this case, the
 corresponding distance will be zero.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_split_join_distance}{\code{split_join_distance()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Community.html#igraph_split_join_distance}{\code{split_join_distance}}
 }
 
 \references{
diff --git a/man/stCuts.Rd b/man/stCuts.Rd
index 437d55c739f..b1c3498e29e 100644
--- a/man/stCuts.Rd
+++ b/man/stCuts.Rd
@@ -20,7 +20,7 @@ stCuts(graph, source, target)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/stMincuts.Rd b/man/stMincuts.Rd
index fc8fed3d4cb..7c7e5427a46 100644
--- a/man/stMincuts.Rd
+++ b/man/stMincuts.Rd
@@ -26,7 +26,7 @@ here.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/st_cuts.Rd b/man/st_cuts.Rd
index 73537aa8bb6..06d9c196447 100644
--- a/man/st_cuts.Rd
+++ b/man/st_cuts.Rd
@@ -38,7 +38,7 @@ removing these edges from \eqn{G} there is no directed path from \eqn{s} to
 \eqn{t}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_cuts}{\code{all_st_cuts}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/st_min_cuts.Rd b/man/st_min_cuts.Rd
index 92afe1a77d4..8401025608f 100644
--- a/man/st_min_cuts.Rd
+++ b/man/st_min_cuts.Rd
@@ -54,7 +54,7 @@ simply the number of edges.
 An \eqn{(s,t)}-cut is minimum if it is of the smallest possible size.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_all_st_mincuts}{\code{all_st_mincuts}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/static.fitness.game.Rd b/man/static.fitness.game.Rd
index 69fefe3db2b..53abb2625bd 100644
--- a/man/static.fitness.game.Rd
+++ b/man/static.fitness.game.Rd
@@ -37,7 +37,7 @@ graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_fitness_game}{\code{static_fitness_game}}
 }
 
 \keyword{internal}
diff --git a/man/static.power.law.game.Rd b/man/static.power.law.game.Rd
index 0f7b5af522c..78bbc309f2e 100644
--- a/man/static.power.law.game.Rd
+++ b/man/static.power.law.game.Rd
@@ -44,7 +44,7 @@ finite size correction of Cho et al., see references below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_static_power_law_game}{\code{static_power_law_game}}
 }
 
 \keyword{internal}
diff --git a/man/stochastic_matrix.Rd b/man/stochastic_matrix.Rd
index 74573536f5a..61a12656291 100644
--- a/man/stochastic_matrix.Rd
+++ b/man/stochastic_matrix.Rd
@@ -36,7 +36,7 @@ where it is assumed that \eqn{D} is non-singular.  Column stochastic
 matrices are defined in a symmetric way.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic}{\code{get_stochastic()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic_sparse}{\code{get_stochastic_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic}{\code{get_stochastic}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_stochastic_sparse}{\code{get_stochastic_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/strength.Rd b/man/strength.Rd
index a9865663e2d..91cf0b926e1 100644
--- a/man/strength.Rd
+++ b/man/strength.Rd
@@ -36,7 +36,7 @@ A numeric vector giving the strength of the vertices.
 Summing up the edge weights of the adjacent edges for each vertex.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_strength}{\code{strength}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/subcomponent.Rd b/man/subcomponent.Rd
index 9999b20527e..57b04411c50 100644
--- a/man/subcomponent.Rd
+++ b/man/subcomponent.Rd
@@ -29,7 +29,7 @@ vertices from which a given vertex is reachable via a directed path.
 A breadth-first search is conducted starting from vertex \code{v}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/subgraph.Rd b/man/subgraph.Rd
index 3990b47854f..9f60fc82de4 100644
--- a/man/subgraph.Rd
+++ b/man/subgraph.Rd
@@ -58,7 +58,7 @@ is deprecated. In the next major version, \code{subgraph()} will overtake the
 functionality of \code{subgraph_from_edges()}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_subgraph_from_edges}{\code{subgraph_from_edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_induced_subgraph}{\code{induced_subgraph}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_subgraph_from_edges}{\code{subgraph_from_edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/subgraph.centrality.Rd b/man/subgraph.centrality.Rd
index 42823666163..4fb5737ae77 100644
--- a/man/subgraph.centrality.Rd
+++ b/man/subgraph.centrality.Rd
@@ -20,7 +20,7 @@ loops edges from the graph before the calculation.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/subgraph.edges.Rd b/man/subgraph.edges.Rd
index 82b952b275b..87116aea2fc 100644
--- a/man/subgraph.edges.Rd
+++ b/man/subgraph.edges.Rd
@@ -21,7 +21,7 @@ not have any adjacent edges in \code{eids}.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_subgraph_from_edges}{\code{subgraph_from_edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Operators.html#igraph_subgraph_from_edges}{\code{subgraph_from_edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/subgraph_centrality.Rd b/man/subgraph_centrality.Rd
index c5c4d0e89ff..c911240f2ed 100644
--- a/man/subgraph_centrality.Rd
+++ b/man/subgraph_centrality.Rd
@@ -30,7 +30,7 @@ eigenvalues and eigenvectors of the adjacency matrix of the graph. This
 effectively means that the measure can only be calculated for small graphs.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency}{\code{get_adjacency}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_adjacency_sparse}{\code{get_adjacency_sparse}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/subgraph_isomorphic.Rd b/man/subgraph_isomorphic.Rd
index fefa592cf78..4ee37c8c12f 100644
--- a/man/subgraph_isomorphic.Rd
+++ b/man/subgraph_isomorphic.Rd
@@ -87,7 +87,7 @@ If you want to ignore these attributes, then supply \code{NULL} for both of thes
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_subisomorphic_vf2}{\code{subisomorphic_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_subisomorphic_vf2}{\code{subisomorphic_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/subgraph_isomorphisms.Rd b/man/subgraph_isomorphisms.Rd
index e4d2c64379f..00b78a1ce20 100644
--- a/man/subgraph_isomorphisms.Rd
+++ b/man/subgraph_isomorphisms.Rd
@@ -93,7 +93,7 @@ If you want to ignore these attributes, then supply \code{NULL} for both of thes
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_get_subisomorphisms_vf2}{\code{get_subisomorphisms_vf2()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_get_subisomorphisms_vf2}{\code{get_subisomorphisms_vf2}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/tail_of.Rd b/man/tail_of.Rd
index 0e1963d6b4b..d30547bd0e4 100644
--- a/man/tail_of.Rd
+++ b/man/tail_of.Rd
@@ -20,7 +20,7 @@ For undirected graphs, head and tail is not defined.  In this case
 \code{head_of()} returns the other end(s) of the edge(s).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/tkplot.Rd b/man/tkplot.Rd
index 8d91b60562e..072cd47096f 100644
--- a/man/tkplot.Rd
+++ b/man/tkplot.Rd
@@ -182,7 +182,7 @@ tkcreate(canvas, "text", width/2, 25, text="My title",
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_is_directed}{\code{is_directed}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_get_edgelist}{\code{get_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \seealso{
diff --git a/man/tkplot.center.Rd b/man/tkplot.center.Rd
index 4adec865483..25a1dc65c5f 100644
--- a/man/tkplot.center.Rd
+++ b/man/tkplot.center.Rd
@@ -16,7 +16,7 @@ tkplot.center(tkp.id)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/tkplot.fit.to.screen.Rd b/man/tkplot.fit.to.screen.Rd
index 2b2e3cd1b20..9adb7cb10a5 100644
--- a/man/tkplot.fit.to.screen.Rd
+++ b/man/tkplot.fit.to.screen.Rd
@@ -20,7 +20,7 @@ tkplot.fit.to.screen(tkp.id, width = NULL, height = NULL)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/tkplot.reshape.Rd b/man/tkplot.reshape.Rd
index 221d2727f4e..1dd56f3a666 100644
--- a/man/tkplot.reshape.Rd
+++ b/man/tkplot.reshape.Rd
@@ -23,7 +23,7 @@ the complete list.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/tkplot.rotate.Rd b/man/tkplot.rotate.Rd
index 023784349c0..ae24a3d4158 100644
--- a/man/tkplot.rotate.Rd
+++ b/man/tkplot.rotate.Rd
@@ -20,7 +20,7 @@ tkplot.rotate(tkp.id, degree = NULL, rad = NULL)
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/tkplot.setcoords.Rd b/man/tkplot.setcoords.Rd
index b130c52887a..de236f53c18 100644
--- a/man/tkplot.setcoords.Rd
+++ b/man/tkplot.setcoords.Rd
@@ -19,7 +19,7 @@ vertices, in absolute coordinates.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/to_prufer.Rd b/man/to_prufer.Rd
index 2e0debf12a1..e02054f4705 100644
--- a/man/to_prufer.Rd
+++ b/man/to_prufer.Rd
@@ -24,7 +24,7 @@ the vertex that it was connected to to the sequence. Repeat until there are
 only two vertices in the remaining graph.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_prufer}{\code{to_prufer()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_to_prufer}{\code{to_prufer}}
 }
 
 \examples{
diff --git a/man/topo_sort.Rd b/man/topo_sort.Rd
index 18f7f4f6743..99297361e7e 100644
--- a/man/topo_sort.Rd
+++ b/man/topo_sort.Rd
@@ -31,7 +31,7 @@ acyclic (it has at least one cycle), a partial topological sort is returned
 and a warning is issued.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_topological_sorting}{\code{topological_sorting()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_topological_sorting}{\code{topological_sorting}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/topological.sort.Rd b/man/topological.sort.Rd
index bcf2cdbe477..724c4302342 100644
--- a/man/topological.sort.Rd
+++ b/man/topological.sort.Rd
@@ -22,7 +22,7 @@ nodes from which it receives edges. Nodes with no outgoing edges go first.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_topological_sorting}{\code{topological_sorting()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_topological_sorting}{\code{topological_sorting}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/transitive_closure.Rd b/man/transitive_closure.Rd
index fa2252f0ef2..54d6f698dea 100644
--- a/man/transitive_closure.Rd
+++ b/man/transitive_closure.Rd
@@ -30,7 +30,7 @@ For undirected graphs, this is equivalent to connecting all vertices that
 are in the same connected component.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitive_closure}{\code{transitive_closure()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitive_closure}{\code{transitive_closure}}
 }
 
 \examples{
diff --git a/man/transitivity.Rd b/man/transitivity.Rd
index c3f3c671146..d5093e03a5b 100644
--- a/man/transitivity.Rd
+++ b/man/transitivity.Rd
@@ -103,7 +103,7 @@ multiple and/or loop edges. If you want to calculate it for a directed
 graph, call \code{\link[=as_undirected]{as_undirected()}} with the \code{collapse} mode first.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_undirected}{\code{transitivity_undirected()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_local_undirected}{\code{transitivity_local_undirected()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_avglocal_undirected}{\code{transitivity_avglocal_undirected()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_barrat}{\code{transitivity_barrat()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_undirected}{\code{transitivity_undirected}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_local_undirected}{\code{transitivity_local_undirected}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_avglocal_undirected}{\code{transitivity_avglocal_undirected}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_transitivity_barrat}{\code{transitivity_barrat}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/triad.census.Rd b/man/triad.census.Rd
index 9f2b4568f7d..883b240eb9b 100644
--- a/man/triad.census.Rd
+++ b/man/triad.census.Rd
@@ -17,7 +17,7 @@ results a warning, and undefined results.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_triad_census}{\code{triad_census()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_triad_census}{\code{triad_census}}
 }
 
 \keyword{internal}
diff --git a/man/triad_census.Rd b/man/triad_census.Rd
index c5a87dbcf76..9e825e7d50e 100644
--- a/man/triad_census.Rd
+++ b/man/triad_census.Rd
@@ -77,7 +77,7 @@ This functions uses the RANDESU motif finder algorithm to find and count the
 subgraphs, see \code{\link[=motifs]{motifs()}}.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_triad_census}{\code{triad_census()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Motifs.html#igraph_triad_census}{\code{triad_census}}
 }
 
 \examples{
diff --git a/man/unfold.tree.Rd b/man/unfold.tree.Rd
index 98cbf56a6eb..dd761c7a451 100644
--- a/man/unfold.tree.Rd
+++ b/man/unfold.tree.Rd
@@ -24,7 +24,7 @@ search is performed. Typically it contains one vertex per component.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_unfold_tree}{\code{unfold_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_unfold_tree}{\code{unfold_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/unfold_tree.Rd b/man/unfold_tree.Rd
index 1119b8d9be8..32993050cec 100644
--- a/man/unfold_tree.Rd
+++ b/man/unfold_tree.Rd
@@ -39,7 +39,7 @@ The \code{roots} vector can be calculated by simply doing a topological sort
 in all components of the graph, see the examples below.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_unfold_tree}{\code{unfold_tree()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_unfold_tree}{\code{unfold_tree}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/union.igraph.Rd b/man/union.igraph.Rd
index 9f43346ab15..bc917130453 100644
--- a/man/union.igraph.Rd
+++ b/man/union.igraph.Rd
@@ -45,7 +45,7 @@ An error is generated if some input graphs are directed and others are
 undirected.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Isomorphism.html#igraph_permute_vertices}{\code{permute_vertices}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/upgrade_graph.Rd b/man/upgrade_graph.Rd
index 6cb95c8673d..9b4b9468982 100644
--- a/man/upgrade_graph.Rd
+++ b/man/upgrade_graph.Rd
@@ -26,7 +26,7 @@ or the data format of a possibly older igraph graph.
 to the current one.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \seealso{
diff --git a/man/vertex.connectivity.Rd b/man/vertex.connectivity.Rd
index bc8b518225b..d79f3c4350d 100644
--- a/man/vertex.connectivity.Rd
+++ b/man/vertex.connectivity.Rd
@@ -28,7 +28,7 @@ thanks Peter.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_vertex_connectivity}{\code{st_vertex_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_connectivity}{\code{vertex_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_vertex_connectivity}{\code{st_vertex_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_connectivity}{\code{vertex_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/vertex.disjoint.paths.Rd b/man/vertex.disjoint.paths.Rd
index 575138c7ee5..cb426007e65 100644
--- a/man/vertex.disjoint.paths.Rd
+++ b/man/vertex.disjoint.paths.Rd
@@ -20,7 +20,7 @@ can be \code{NULL}, see details below.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_disjoint_paths}{\code{vertex_disjoint_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_disjoint_paths}{\code{vertex_disjoint_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \keyword{internal}
diff --git a/man/vertex_attr.Rd b/man/vertex_attr.Rd
index ffd4f90cf60..e366520aa06 100644
--- a/man/vertex_attr.Rd
+++ b/man/vertex_attr.Rd
@@ -24,7 +24,7 @@ all vertex attributes, if \code{name} is missing.
 Query vertex attributes of a graph
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/vertex_connectivity.Rd b/man/vertex_connectivity.Rd
index 7ebbb03f1fb..6ba712e609c 100644
--- a/man/vertex_connectivity.Rd
+++ b/man/vertex_connectivity.Rd
@@ -76,7 +76,7 @@ precisely \code{vertex_connectivity()} is the most general, the other two are
 included only for the ease of using more descriptive function names.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_vertex_connectivity}{\code{st_vertex_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_connectivity}{\code{vertex_connectivity()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_disjoint_paths}{\code{vertex_disjoint_paths()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesion}{\code{cohesion()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_st_vertex_connectivity}{\code{st_vertex_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_connectivity}{\code{vertex_connectivity}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_vertex_disjoint_paths}{\code{vertex_disjoint_paths}}, \href{https://igraph.org/c/html/0.10.17/igraph-Flows.html#igraph_cohesion}{\code{cohesion}}
 }
 
 \examples{
diff --git a/man/voronoi_cells.Rd b/man/voronoi_cells.Rd
index 0db51891f6b..b6e444636ca 100644
--- a/man/voronoi_cells.Rd
+++ b/man/voronoi_cells.Rd
@@ -57,7 +57,7 @@ it is closest.
 \code{\link[=groups]{groups()}} may be used on the output of this function.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_voronoi}{\code{voronoi()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_voronoi}{\code{voronoi}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/walktrap.community.Rd b/man/walktrap.community.Rd
index f8155fbc2fd..14e206af694 100644
--- a/man/walktrap.community.Rd
+++ b/man/walktrap.community.Rd
@@ -45,7 +45,7 @@ for the split corresponding to the highest modularity value.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/watts.strogatz.game.Rd b/man/watts.strogatz.game.Rd
index 9d21b78996b..0cd3f968f0c 100644
--- a/man/watts.strogatz.game.Rd
+++ b/man/watts.strogatz.game.Rd
@@ -29,7 +29,7 @@ generated graph.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_watts_strogatz_game}{\code{watts_strogatz_game()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Generators.html#igraph_watts_strogatz_game}{\code{watts_strogatz_game}}
 }
 
 \keyword{internal}
diff --git a/man/weighted_cliques.Rd b/man/weighted_cliques.Rd
index fc3a65484c6..ba4fb7d292e 100644
--- a/man/weighted_cliques.Rd
+++ b/man/weighted_cliques.Rd
@@ -55,7 +55,7 @@ weight is larger than the weight of this clique.
 \code{weighted_clique_num()} calculates the weight of the largest weighted clique(s).
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_weighted_cliques}{\code{weighted_cliques()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Cliques.html#igraph_weighted_cliques}{\code{weighted_cliques}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}
 }
 
 \examples{
diff --git a/man/which_multiple.Rd b/man/which_multiple.Rd
index b640198ee04..6133136aa3e 100644
--- a/man/which_multiple.Rd
+++ b/man/which_multiple.Rd
@@ -62,7 +62,7 @@ See the examples for getting rid of multiple edges while keeping their
 original multiplicity as an edge attribute.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_loop}{\code{has_loop()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_loops}{\code{count_loops()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_multiple}{\code{is_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_multiple}{\code{has_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_multiple}{\code{count_multiple}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_loop}{\code{is_loop}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_has_loop}{\code{has_loop}}, \href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_count_loops}{\code{count_loops}}
 }
 
 \examples{
diff --git a/man/which_mutual.Rd b/man/which_mutual.Rd
index af1ef35b006..60d78cdaaad 100644
--- a/man/which_mutual.Rd
+++ b/man/which_mutual.Rd
@@ -31,7 +31,7 @@ considered to be mutual.
 Undirected graphs contain only mutual edges by definition.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Structural.html#igraph_is_mutual}{\code{is_mutual}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{
diff --git a/man/write.graph.Rd b/man/write.graph.Rd
index 2dffc81a7ad..2c8a2d0e21f 100644
--- a/man/write.graph.Rd
+++ b/man/write.graph.Rd
@@ -32,7 +32,7 @@ this argument is case insensitive.}
 consistent API.
 }
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \keyword{internal}
diff --git a/man/write_graph.Rd b/man/write_graph.Rd
index 4a912d86df4..b7ff0993cac 100644
--- a/man/write_graph.Rd
+++ b/man/write_graph.Rd
@@ -141,7 +141,7 @@ data exchange or archival.
 }
 
 \section{Related documentation in the C library}{
-\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount()}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount()}}
+\href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_edgelist}{\code{write_graph_edgelist}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_pajek}{\code{write_graph_pajek}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_graphml}{\code{write_graph_graphml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_gml}{\code{write_graph_gml}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_dot}{\code{write_graph_dot}}, \href{https://igraph.org/c/html/0.10.17/igraph-Foreign.html#igraph_write_graph_leda}{\code{write_graph_leda}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_edges}{\code{edges}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_get_eids}{\code{get_eids}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_vcount}{\code{vcount}}, \href{https://igraph.org/c/html/0.10.17/igraph-Basic.html#igraph_ecount}{\code{ecount}}
 }
 
 \examples{