The plan is to add a relatively small set of R functions that mirror a subset of the native threejs functions to build up scenes. Example functions could include
Domination is one of the most central concepts in (algorithmic) graph theory, but there's not a lot of support for domination in IGraphM. As a start, to extend the family consisting of IGDominatorTree and IGImmediateDominators, I'd suggest adding utility functions to verify whether a given subset of vertices form a dominating set.
Lectures on "crime and political corruption analysis using data mining, machine learning and complex networks" at the School of Applied Mathematics in the Institute of Mathematics and Computer Science at University of São Paulo
Describe the bug
While improved test coverage overall is important, I think the priority should be the gexf.c because it is used most frequently in AUK.
Rank the pages in the corpus by considering the inlinks and outlinks. Also handling dead ends and spider traps. Topic Specific Page Rank and visualization of page links using igraph
Demo on applying the concept of network analysis on a network of connected railway stations, attempting to identify the important stations (nodes) in this network. Web scraping techniques using rvest package is also briefly discussed upon.
We've added a new basic
renderfunction that simply displays threejs scenes, optionally with animation. For example:The plan is to add a relatively small set of R functions that mirror a subset of the native threejs functions to build up scenes. Example functions could include