- i -

• id() : pgrouting::Identifier
• Identifier() : pgrouting::Identifier
• Identifiers() : Identifiers< T >
• idx() : pgrouting::Identifier , pgrouting::trsp::EdgeInfo
• in_degree() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• inf_cost_on_restriction() : Path , pgrouting::yen::Pgr_turnRestrictedPath< G >
• init() : GraphDefinition
• Initial_solution() : pgrouting::vrp::Initial_solution
• initialize() : pgrouting::bidirectional::Pgr_bidirectional< G >
• initialize_que() : pgrouting::trsp::Pgr_trspHandler
• initialize_restrictions() : pgrouting::trsp::Pgr_trspHandler
• insert() : pgrouting::vrp::Vehicle , pgrouting::vrp::Vehicle_pickDeliver
• insert_edges() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E > , pgrouting::graph::PgrFlowGraph
• insert_edges_edge_disjoint() : pgrouting::graph::PgrFlowGraph
• insert_edges_neg() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• insert_edges_push_relabel() : pgrouting::graph::PgrFlowGraph
• insert_min_edges_no_parallel() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• insert_negative_edges() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• insert_vertex() : pgrouting::graph::Pgr_lineGraphFull< G, T_V, T_E >
• insert_vertices() : pgrouting::graph::Pgr_lineGraph< G, T_V, T_E >
• InsertEdges() : pgrouting::graph::PgrCostFlowGraph
• 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_contractible() : pgrouting::contraction::Pgr_linear< G >
• is_dead_end() : pgrouting::contraction::Pgr_deadend< G >
• is_delivery() : pgrouting::vrp::Tw_node
• is_directed() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• 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_fleet_ok() : pgrouting::vrp::Fleet
• is_late_arrival() : pgrouting::vrp::Tw_node
• is_linear() : pgrouting::graph::Pgr_contractionGraph< G >
• is_ok() : pgrouting::vrp::Vehicle
• is_order_feasable() : pgrouting::vrp::Vehicle_pickDeliver
• is_order_ok() : pgrouting::vrp::Fleet
• is_phony() : pgrouting::vrp::Vehicle
• is_pickup() : pgrouting::vrp::Tw_node
• is_shortcut_possible() : pgrouting::graph::Pgr_contractionGraph< G >
• is_source() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• is_start() : pgrouting::vrp::Tw_node
• is_symmetric() : pgrouting::tsp::Dmatrix , pgrouting::tsp::EuclideanDmatrix
• is_target() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• is_undirected() : pgrouting::graph::Pgr_base_graph< G, T_V, T_E >
• is_valid() : pgrouting::vrp::Order
• isCompatibleIJ() : pgrouting::vrp::Order
• isEqual() : Path
• isIllegal() : pgrouting::trsp::Pgr_trspHandler::Predecessor
• isPlanar() : pgrouting::functions::Pgr_boyerMyrvold< G >