# Category: Uncategorized

Main data is stored in df, which will be the data for the bar graph, and returns then enter GINI coefficients draw both bar and line graph we then get the x coordinates for the line graph and finally, we draw the line with bgrp as the x coordinates, and gco as the y coordinates

This function takes an nCol file and returns L.C. Freeman’s Group Degree Centrality: Degree centrality (CD) can be calculated as follows: For the following graph we can count the number of connections (edges) each node has (its degree), The maximum degree is 3 for n1. Therefore we subtract the other node degrees from this Then […]

## draw.quick.graph – R

## Color Nodes – R

## Dated posts for a SN – R

## Frequency, Degree, Centrality – R

This little function calculates Degree Centrality (CD) for each node in an undirected simplified graph. The node column also has to be entered as data frame. Then you get it to work like this… And that should return something like

## The Full Graphing Monty – R

Spent the entire day bashing out graphs (not a euphemism at all). I did some pretty intense node analysis, and then some plotting. This what I used for plotting This is the final result — one of the smaller graphs. Just as a final note. I freaking LOVE MacVim.

You must be logged in to post a comment.