What’s a good resource for understanding relations in data structures & discrete math?

While calculating the between-ness or closeness score for an individual, should I use a directed graph or an undirected graph? Which is more insightful?

Can I find the shortest Hamiltonian path in a complete weighted undirected graph in polynomial time (where all weights are non-negative)?

What is a good real-life example of Breadth-First Search?

How do I solve Appleman and Easytask (462A Codeforces Round #263 div 2) problem on Codeforces?

What algorithm can detect whether a sentence is suitable for academic journal or not?

How long does it take you to program a reasonably complicated algorithm?

Why do we use algorithm?

Are algorithm questions solvable in GATE?

What are the algorithms for different vertical industries?

How can the phase inversion operator in Grover’s algorithm resemble anything physical?

Where can I learn the concepts of algorithms and data structures?

How can I develop my algorithmic skills?

What algorithm can be used to search recipes given some of the ingredients?

How can one stop the search to first neighbours in a directed/undirected graph in C code?

Can you suggest MATLAB algorithms for shot detection?

How can I prove or disprove log(n!)∈Θ(n2)log⁡(n!)∈Θ(n2)log(n!)inTheta (n^2) in asymptotic notation?

How do I balance time between learning web-development (JavaScript) and Algorithm Data-Structures?

How do I solve this problem of Codeforces?

What is the exact and easily understandable definition of a subtree? Is the following tree S the subtree of T?