Skip to content

Instantly share code, notes, and snippets.

View dingaroo's full-sized avatar
💭
I may be slow to respond.

Arifin Othman dingaroo

💭
I may be slow to respond.
View GitHub Profile
@dingaroo
dingaroo / gist:9dcd2f360b524cb97b18ce3a7ecf469d
Created May 12, 2018 04:59 — forked from econchick/gist:4666413
Python implementation of Dijkstra's Algorithm
class Graph:
def __init__(self):
self.nodes = set()
self.edges = defaultdict(list)
self.distances = {}
def add_node(self, value):
self.nodes.add(value)
def add_edge(self, from_node, to_node, distance):
@dingaroo
dingaroo / myCount.R
Created November 26, 2020 05:29
Count Occurrence of certain words from a dataframe row in #R
library(stringr)
getCount <- function(data,keyword)
{
wcount <- str_count(dataset$text, keyword)
return(data.frame(data,wcount))
}
@dingaroo
dingaroo / getCount.R
Created November 26, 2020 06:09
#Updated Count Occurrence of word in column in dataframe in #R
library(stringr)
getCount <- function(data,keyword)
{
wcount <- str_count(unique_notes$NOTES, keyword)
# return(data.frame(wcount))
return(wcount)
}