We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f628133 commit 4374f42Copy full SHA for 4374f42
3 files changed
src/_igraph/attributes.c
@@ -1884,7 +1884,7 @@ static igraph_attribute_table_t igraphmodule_attribute_table = {
1884
};
1885
1886
void igraphmodule_initialize_attribute_handler(void) {
1887
- igraph_i_set_attribute_table(&igraphmodule_attribute_table);
+ igraph_set_attribute_table(&igraphmodule_attribute_table);
1888
}
1889
1890
/**
tests/test_basic.py
@@ -338,14 +338,14 @@ def testAdjacency(self):
338
self.assertTrue(g.get_adjlist(IN) == [[2], [0], [1], [2]])
339
self.assertTrue(g.get_adjlist(ALL) == [[1, 2], [0, 2], [0, 1, 3], [2]])
340
341
- def testEdgeIncidency(self):
+ def testEdgeIncidence(self):
342
g = Graph(4, [(0, 1), (1, 2), (2, 0), (2, 3)], directed=True)
343
self.assertTrue(g.incident(2) == [2, 3])
344
self.assertTrue(g.incident(2, IN) == [1])
345
- self.assertTrue(g.incident(2, ALL) == [2, 3, 1])
+ self.assertTrue(g.incident(2, ALL) == [2, 1, 3])
346
self.assertTrue(g.get_inclist() == [[0], [1], [2, 3], []])
347
self.assertTrue(g.get_inclist(IN) == [[2], [0], [1], [3]])
348
- self.assertTrue(g.get_inclist(ALL) == [[0, 2], [1, 0], [2, 3, 1], [3]])
+ self.assertTrue(g.get_inclist(ALL) == [[0, 2], [0, 1], [2, 1, 3], [3]])
349
350
def testMultiplesLoops(self):
351
g = Graph.Tree(7, 2)
vendor/source/igraph
0 commit comments