  High-Level Synthesis has introduced reconfigurable logic to a new world --
that of software development. The newest wave of HLS tools has been successful,
and the future looks bright. But is HLS the end-all-be-all to FPGA
acceleration? Is it enough to allow non-experts to program FPGAs successfully,
even when dealing with troublesome data structures and complex control flows --
such as those often encountered in graph algorithms? We take a look at the
panorama of adoption of HLS by the software community, focusing on graph
analysis in particular in order to generalise to \textit{FPGA-unfriendly}
problems. We argue for the existence of shortcomings in current HLS development
flows which hinder adoption, and present our perspective on the path forward,
including how these issues may be remedied via higher-level tooling.
