Minimum Spanning Tree is very efficient way to work with data. Its from graph theory, and if you import graph data, it should be very fast to generate trees in the edge set. And the combination of directed and undirected graphs can control the movement direction of core and non-core points. Wouldn't this accomplish the task of categorizing network nodes. I tried to import the graph data and modify it in the source code and the result is not very good. Forgive my bad programming skills. I would like to inquire if it is possible to develop an interface to the graph object? If it's too much trouble, forget it. Also, would like to thank you guys for your work, the library is really nice.
Minimum Spanning Tree is very efficient way to work with data. Its from graph theory, and if you import graph data, it should be very fast to generate trees in the edge set. And the combination of directed and undirected graphs can control the movement direction of core and non-core points. Wouldn't this accomplish the task of categorizing network nodes. I tried to import the graph data and modify it in the source code and the result is not very good. Forgive my bad programming skills. I would like to inquire if it is possible to develop an interface to the graph object? If it's too much trouble, forget it. Also, would like to thank you guys for your work, the library is really nice.