Skip to content

function parity with igraph C core #389

@iosonofabio

Description

@iosonofabio

We should aim, as a continuous self-improvement kind of goal, to close the gap in function availability between the igraph C core and the Python interface. To help with that, let's try and keep track of what functions:

  • are missing from the Python interface
  • would be useful to have there
  • are already implemented in the C core

Other igraph folks: please feel free to edit the list adding functions you find or deleting them if they got implemented or if you think they aren't necessary in the Python interface:

  • maximal_cliques_count
  • maximal_cliques_subset
  • clique_size_hist and other histogram functions (useful for large graphs, where a list of all items would be too large)
  • weighted cliques functions (?)
  • vertex_coloring_greedy
  • trussness
  • eigen_laplacian
  • laplacian_spectral_embedding
  • SIR simulations (do we want it?)
  • is_eulerian and related functions
  • is_bigraphical
  • graphlet functions (SKIP)
  • is_matching and is_maximal_matching (they seem to be there partially, perhaps a quick fix?)
  • maximum_bipartite_matching (it's there but buggy)
  • random_edge_walk (i.e. get random_walk result in terms of edges)
  • from_prufer
  • maximum_cardinality_search and is_chordal
  • local scan statistics (?)
  • random_spanning_tree
  • "microscopic update rules" (do we want it? it's not in any high-level interface now)
  • shortest path functions should return either vertices or edges
  • pseudo_diameter and pseudo_diameter_dijkstra
  • layout_gem
  • new methods of to_directed
  • transitive_closure
  • rewire_directed_edges
  • Bliss isomorphism: return generators of the automorphism group; return number of automorphisms
  • is_chordal (Graph.is_chordal #437)
  • global and local efficiency
  • igraph_list_triangles
  • automorphism_group and autmorphisms (which counts them)
  • voronoi
  • widest path functions
  • shortest path functions with cutoff
  • symmetric_tree
  • regular_tree
  • wheel
  • triangular and hexagonal lattice generators
  • Floyd-Warshall shortest path
  • spanner
  • is_forest
  • graph_count (for use with motif functions)
  • has_loop
  • has_mutual
  • is_perfect
  • generalized_petersen
  • full_multipartite and turan
  • graph_center
  • ecc
  • callaway_traits_game
  • cited_type_game
  • citing_cited_type_game

Metadata

Metadata

Assignees

No one assigned

    Labels

    todoTriaged for implementation in some unspecified future version

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions