JNI调用api：获取具有多个参数的方法的方法id(JNI invocation api: get method id for method with multiple parameters)

 在基地，您将以树为单位查看您的城市网络，以离开的城市为根，每个离开的航班都是指向孩子的指针。 您将在树中执行递归深度优先搜索以查找到目标的所有路径，但是在您前进时检查一个循环并中止导致循环的任何路径。 
 
 当你找到可行的路径时，你可以保持最短但是找到一个单一的解决方案; 或保留更大的路径子集，如果您想在此基础上选择，则按出发时间的某些标准进行分层。 
 
 根据数据库和节点的具体情况，您还可以引入其他规则来缩短路径搜索时间，例如，如果您碰巧知道出发地和目的地相距1000英里，并且您到目前为止的路径已经飞行了3000次英里，你仍然不在那里，拧紧它，继续前进到下一个路径搜索。 

At the base, you're going to view your city network as a tree, with departing city as root, and each departing flight being a pointer to a child. You'll do a recursive depth-first search through the tree to find all paths to the destination, but checking for a cycle as you go and aborting any path that results in a cycle.
 
As you find feasible paths, you can either just keep the shortest yet found as a singular solution; or keep a larger subset of paths found, stratified by some criteria around departure time if you want to select on that basis.
 
Depending on the specifics of the database and nodes, you can also throw in other rules for cutting short your path searches, e.g., if you happen to know that departure and destination are 1000 miles apart, and your path traced so far has you flying 3000 miles and you're still not there, screw it, move on to the next path search.