1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
o rewrite igraph_i_eit_create_allfromto, etc., it's just a copy of the
index.
o R interface: curved edges in plots (tkplot and plot)
o attribute support in to_undirected
o calculate the actual maximum flow
o find a way for writing equations in DocBook.
o read and write non-structural info from/to GraphML files
read:
- error handling
- handle different types of attributes properly (eg. boolean)
o the number of isomorphism classes for a given graph size
o index in pdf manual
o PAJEK import improvements:
- affiliation networks, AFFIL.NET: *Vertices n n1
- multiple edge sets in the same graph (?), Sampson.net, Multi.net,
SampsonL.net
- color conversion, see colors in the Pajek manual
o rewrite add_edges, add_vertices, they're a mess
o better random number generator handling (init with seed, etc...)
o uniform graph operators (union, intersection, etc...)
o attribute handling for operators
o merging layouts properly, multicompartmental layout functions
o eccentricity
o bi-connected components (or k connected component), articulations points
o connectedness, efficiency, hierarchy, lubness
o igraph.Arrows: better implementation of 'code',
it should also handle the case when it is a vector
o make possible building in separate directory (make check, r package,
make dist do not work)
o write tutorial
o add some iterators: in-, pre-, post-order, depth-first, breadth-first
search, iterators based on attributes etc.
o add data sets to the R package
o add automatic tests, add valgrind option to tests (?)
o make docs look better: index, section tocs
o make better and faster doxrox engine
o create man pages
o implement IGRAPH_STRONG in igraph_decompose
o top-down and radial layout algorithm for tree graphs
o Hamilton and Euler circles/paths
o method to turn the edges to the opposite direction in a graph
o selective copy: copy only selected edges with attributes
o method for vertex and edge to return all attrs as a hash
Python interface:
o Add Python interface to igraph_callaway_traits_game,
igraph_barabasi_aging_game, igraph_recent_degree_aging_game
o Add Python edge/vertex selector support
o iterator over all components
o iterator over all circles
o make del operator work for attributes
o make in-place addition and subtraction operators NOT copy the graph if
a disjoint union or difference is taken
o igraph_is_loop, igraph_is_multiple
o igraph_cited_type_game, igraph_citing_cited_type_game, igraph_lastcit_game
|
