Categories

## Sorting by first two letters in first column then by text in second column

In my job, every day I receive excel file with 2 columns (A1, B2) of unsorted data. For example: A1 B2 DD E AA Y CC C AA W CC B CE I AA P CE C DD Y What I wanted to do is to sort it first by 2 letters of cell in […]

Categories

## Read dinamically CSV files in Python

How I read CSV’s files dinamically in Python, when change the suffix name files? Example: import pandas as pd uf = [‘AC’, ‘AL’, ‘AP’, ‘AM’, ‘BA’, ‘CE’, ‘DF’, ‘ES’, ‘GO’, ‘MA’, ‘MT’, ‘MS’, ‘MG’, ‘PA’, ‘PB’, ‘PR’, ‘PE’, ‘PI’, ‘RJ’, ‘RN’, ‘RS’, ‘RO’, ‘RR’, ‘SC’, ‘SP1’, ‘SP2’, ‘SE’, ‘TO’] for n in uf: {n} = […]

Categories

## calculate n number of possibilities with array values

I have three arrays A[]={“a”,”b”},B[]={“c”,”d”},C[]={“e”,”f”}. Output={“ace”},{“acf”},{“ade”},{“adf”},{“bce”},{“bcf”},{“bde”},{“bdf”} By using these three arrays i have to calculate the possibilities. Similarly i want to calculate the possibilities for n number of arrays.

Categories

## How to select the weighted pairs of edges of an igraph in R?

I have a random directed weighted graph g. The adjacency matrix of graph is a transition matrix TM. I need to find the second order of transition matrix. I mean, I need to calcucalete the propability of transitions from a vertex u to a vertex v through a vertex t, i.e. P(u->t->v). In my attempt, […]

Categories

## Spring Batch – Unable to deserialize the execution context – OffsetDateTime – cannot deserialize

I’m trying to create a spring batch job with multiples steps and passing object from step to step. To do this I use ExecutionContext that i promoted from step to job context. At first run, no problem data goes right from step to step At next runs, I get the error : “Unable to deserialize […]

Categories

## DFS on a graph the non-recursive way

I’m working on an exercise and I’m kind of stuck, need some help. Suppose we have the following vertices and edges on a directed graph: AB, BC, AD, CD, DC, DE, CE, EB, AE depicted below Trying to figure out how many “trips” exist from C to C, with no more than 3 edges. That […]