tidygraph | A tidy API for graph manipulation | Data Visualization library

Objective: I want to count the number of incoming edges of a partial type for each node. How can I do that?

Criteria:

• I need to use the R package tidygraph
• Answers that allow me to mutate an existing graph via a magrittr pipeline are better
• Fewer lines of code are better

The following code will generate an example graph

As the title says. I have a graph object created using igraph::sample_grg(), which I want to plot using ggraph, with nodes positioned according to the node attributes x and y. What I have tried:

Create graph:

Suppose I have the following directed acyclic graph (DAG) with each node having a weight of 1.

I am interested in calculating the accumulated sum of each node based on the value of its ancestor. Assuming as I said earlier that the weight of each node is 1, then this is what I would expect to get

This is what I tried to do:

Hello and hope all goes well. I made an edit to my previous question and hope it makes it more clear.

I created an igraph object and would like to run same analysis several times and extract some information in each iteration.

I can't share the whole data, so I am sharing just a small subset. df_edge is as follows:

I'm creating a sample ego network plot, but I'd like the nodes to be closer together, specifically, the alter nodes closer to the ego node. My code:

I'm trying to make a sample ego network plot, but coloring the nodes using "fill" isn't working for me. This may be a trivial issue, but I can't figure out the problem. This is my code:

I have a friendship network dataset over several waves. I want to plot the friendships that persist over the waves, and keep the nodes in the same coordinates for each plot. I'm able to use ggraph and graphlayouts' dynamic layout to keep the nodes in the same positions over four waves, but I want to remove the nodes over time that lose their ties. This is an example of what I have done so far:

Im calculating the shortest path between 2 points in sfnetwork my_sfn.

The calculated path consists of graph ids kept in variable paths and I and would like to get geometry (gps values) connected to those ids.

which is done with:

I want to assign unique IDs say 1,2, 3, …,n for the points in R dataframe dt. Starting from the first row a point is assigned ID 1 if the row-wise difference of x or y or both is <10. The point continuously gets ID 1 until there is a gap in Date and the difference in x or y or both is <10. So A single ID is assigned for a point for all the days until either (i) there is a gap in Date and/or (ii) the row-wise difference of x or y or both is <10. I expect output like in expectedid column in the dt or like in this plot.

Or the other way to achieve what I want is to subset all the points from dt that has <10 difference in row-wise x or y or both and no gaps in the date, assign/write them as a set of dataframe and continue for next set and so on.