Meaning of the annotations for the proof of each method:
- local_polyh: uses a local linear ranking function for the binary unfolding with polyhedra
- local_mono: uses a local linear ranking function for the binary unfolding with monotonicity constraints
- global_affrnkfn: uses a global affine ranking function with polyhedra
- numerical: the ranking function uses numerical variables or fields
- structural: the ranking function uses reference variables or fields
- loop: the method seems to be part of a loop or recursion

All calls to these methods terminate:
                                             public Weight.(double):void
[loop,numerical,structural,local_polyh,local_mono]public Graph.dijkstra(int):void
[loop,numerical,structural,local_mono]       public Graph.(int):void
[loop,numerical,structural,local_mono]       public static Graph.example(java.lang.String[]):Graph
[loop,numerical,structural,local_mono]       public Graph.bellmanFord(int):boolean
[loop,numerical,structural,local_polyh]      public static Graph.main(java.lang.String[]):void
[loop,numerical,structural,local_polyh]      private Graph.init():void
                                             public Graph.addEdge(int,int,double):void
                                             public Graph.relax(int,int):void

Some calls to these methods might not terminate:
  none
There are no warnings