IGraphM
IGraphM copied to clipboard
szhorvat
IGraph/M is the igraph interface for Mathematica
There should be more informative messages for invalid string-value options. Example: `IGRealizeDegreeSequence` with an invalid method issues "Unknown degree sequence realization method." The error should list valid methods. Typically, these...
`IGLayoutTutte` should be faster. Example: ``` mg = IGMeshGraph@BoundaryDiscretizeRegion[Ball[], MaxCellMeasure -> 0.001]; In[118]:= IGLayoutTutte[mg]; // AbsoluteTiming Out[118]= {21.0373, Null} In[119]:= GraphEmbedding[mg, "TutteEmbedding"]; // AbsoluteTiming Out[119]= {6.64426, Null} ```
LAD functions should be able to stop after finding given number of isomorphisms. Depends on new LAD port into C core, just like #1
It is not ready yet but quite nice already: ```mathematica IGGraphEditor[ Graph[{1 -> 1, 1 -> 1, 1 -> 1, 2 -> 2, 1 -> 2, 1 -> 2, 1...
In β-skeleton calculations, when point coordinates are much larger than the typical inter-point distance, roundoff errors may become larger than the relative tolerances used to detect boundary points. This may...
See https://doi.org/10.1112/jlms/s1-40.1.87 , Theorem 3. Also review https://dx.doi.org/10.1186%2Fs13660-017-1544-3 Theorem 3.1 condition (ii). Pay special attention to the singleton graph and null graph.
Use meaningful vertex names in graph generators - [ ] IGSquareLattice - [ ] IGDeBruijnGraph - [ ] IGKautzGraph This should only be done after dropping support for older M...
References: https://en.wikipedia.org/wiki/Resistance_distance https://mathematica.stackexchange.com/a/193130/12 https://mathematica.stackexchange.com/a/195039/12 https://networkx.github.io/documentation/networkx-1.9/reference/algorithms.centrality.html#current-flow-closeness http://mathworld.wolfram.com/KirchhoffIndex.html
When converting between meshes and the corresponding planar graphs, it is often useful to be aware of which face is the outer one. There is no ambiguity if the graph...
Current syntax: `IGAdjacencyMatrixPlot[graph, vertices]`. Should extend to: `IGAdjacencyMatrixPlot[graph, vertices1, vertices2]`, which plots a sub-matrix based on the rows and columns corresponding to the two given vertex sets. This will be...