1. For a binary-heap implementation of a priority queue, both insert() and delete-min() take log n time. This is described in section 4.5.2 of the textbook and in the gray box on page 114.
2. No. If every edge has positive length, then any path from a vertex to itself forms a positive cycle. Thus, the shortest path from s to t would not revisit a vertex.