- i -

• id() : pgrouting::vrp::Node , pgrouting::vrp::Order , pgrouting::vrp::Vehicle
• Identifiers() : Identifiers< T >
• ids() : Identifiers< T >
• in_degree() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• in_degree_from_vertex() : pgrouting::graph::Pgr_contractionGraph< G, T_V, T_E >
• init() : BiDirAStar , CSolutionInfo , CTourInfo , CVehicleInfo , CVRPSolver , GraphDefinition , MinHeap
• initall() : BiDirAStar
• Initial_solution() : pgrouting::vrp::Initial_solution
• initialize() : Pgr_bdDijkstra< G >
• insert() : Identifiers< T > , pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_pickDeliver
• insert_edges() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• insert_less_travel_time() : pgrouting::vrp::Vehicle
• insert_while_compatibleI() : pgrouting::vrp::Initial_solution
• insert_while_compatibleJ() : pgrouting::vrp::Initial_solution
• insert_while_feasable() : pgrouting::vrp::Initial_solution
• insertOrder() : CTourInfo , CVRPSolver
• insertUnservedOrders() : CVRPSolver
• instance() : SignalHandler
• inter_swap() : pgrouting::vrp::Optimize
• invariant() : pgrouting::tsp::TSP< MATRIX > , pgrouting::vrp::Initial_solution , pgrouting::vrp::Vehicle
• is_compatible_IJ() : pgrouting::vrp::Tw_node
• is_dead_end() : pgrouting::contraction::Pgr_deadend< G >
• is_delivery() : pgrouting::vrp::Tw_node
• is_directed() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• is_dump() : pgrouting::vrp::Tw_node
• is_early_arrival() : pgrouting::vrp::Tw_node
• is_end() : pgrouting::vrp::Tw_node
• is_feasable() : pgrouting::vrp::Solution , pgrouting::vrp::Vehicle
• is_late_arrival() : pgrouting::vrp::Tw_node
• is_linear() : pgrouting::contraction::Pgr_linear< G >
• is_load() : pgrouting::vrp::Tw_node
• is_on_time() : pgrouting::vrp::Tw_node
• is_partially_compatible_IJ() : pgrouting::vrp::Tw_node
• is_partially_waitTime_compatible_IJ() : pgrouting::vrp::Tw_node
• is_pickup() : pgrouting::vrp::Tw_node
• is_source() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• is_start() : pgrouting::vrp::Tw_node
• is_symmetric() : pgrouting::tsp::Dmatrix , pgrouting::tsp::eucledianDmatrix
• is_target() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• is_tight_compatible_IJ() : pgrouting::vrp::Tw_node
• is_undirected() : pgrouting::graph::Pgr_base_graph< G, Vertex, Edge >
• is_valid() : pgrouting::vrp::Order , pgrouting::vrp::Tw_node
• is_waitTime_compatible_IJ() : pgrouting::vrp::Tw_node
• isBetter() : CMoveInfo
• isCompatibleIJ() : pgrouting::vrp::Order
• isDisjoint() : Identifiers< T >
• isEqual() : Path
• isSamePos() : pgrouting::vrp::Node
• isTabuMove() : CVRPSolver