Searched refs:node_t (Results 1 – 5 of 5) sorted by relevance
61 typedef typename GraphTraits::node_t node_t; typedef64 dedge (node_t *src, node_t *dest) in dedge()71 node_t *const m_src;72 node_t *const m_dest;83 typedef typename GraphTraits::node_t node_t; typedef101 void add_node (node_t *node);104 auto_delete_vec<node_t> m_nodes;129 typedef typename GraphTraits::node_t node_t; typedef134 virtual void add_node (node_t *node) = 0;165 node_t *n; in dump_dot_to_pp()[all …]
36 typedef typename GraphTraits::node_t node_t; typedef40 shortest_paths (const graph_t &graph, const node_t *origin);42 path_t get_shortest_path (const node_t *to) const;65 const node_t *origin) in shortest_paths()106 node_t *n in shortest_paths()107 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]); in shortest_paths()114 node_t *dest = succ->m_dest; in shortest_paths()130 shortest_paths<GraphTraits, Path_t>::get_shortest_path (const node_t *to) const in get_shortest_path()
57 typedef value_type node_t; typedef58 typedef node_t * pnode_t;302 return __c_malloc(n * sizeof(node_t)); in _A_allocate()318 static void _A_insert_aux1(c_pvector thiz, c_iterator pos, node_t val) in _A_insert_aux1()323 node_t node; in _A_insert_aux1()393 return (size_type)(-1) / sizeof(node_t); in c_vector_max_size()