The proof that Finding all simple paths between two nodes in an undirected graph is NP

Question

The topology is given and undirected. Given 2 nodes s,t. Then find all simple paths (no cycle) between s and t. As far as I know, it\'s a NPC or NP-hard problem. But I read plen