Bellman–Ford algorithm is the beginning. you see, yours truly, is in need of some negative cycles.
And ain't your graph nerd at the moment. I simple. scrape and find python code.
runs all good. I got more questions. not only negative cycles. i want to know who the popular kids in school are. damn. i need the graph theory. this whole code scraping left me with a tool without the proper knowledge to use it properly.
apparently networkx is cool. but i am already deeper. i am considering attacking graph theory.
where from? how? Wilberger demonstrates the power of algebra. How do they calculate in graph theory?
show me sample calculations. i got klong. would like to program it in array language.
hours hours hours of traveling the code spread across the web dunes.
indeed, the most elegant code comes from GraphBLAS.
[ standard building blocks for graph algorithms in the language of linear algebra ]
k, nice, matrices, drop it in klong, your good to go.
no so fast kiddo.
sparse matrices are not available in klong, the big calculations are just gonna get clogged.
GraphBLAS code it is.
c, me no blind
but first... let's study, discuss, and question together
i would gladly listen to your opinions on pic related