Table of Contents - ogr-0.2.0 Documentation
Classes and Modules
- Ogr
- Ogr::BreadthFirstSearch
- Ogr::ConnectedComponents
- Ogr::DepthFirstSearch
- Ogr::Digraph
- Ogr::Edge
- Ogr::EdgeBag
- Ogr::Graph
- Ogr::GraphAsList
- Ogr::GraphAsMatrix
- Ogr::GraphAsTriMatrix
- Ogr::MinimumSpanningTree
- Ogr::ShortestPaths
- Ogr::TopologicalSort
- Ogr::UnionFind
Methods
- ::new — Ogr::BreadthFirstSearch
- ::new — Ogr::ConnectedComponents
- ::new — Ogr::DepthFirstSearch
- ::new — Ogr::Digraph
- ::new — Ogr::Edge
- ::new — Ogr::EdgeBag
- ::new — Ogr::Graph
- ::new — Ogr::GraphAsList
- ::new — Ogr::GraphAsMatrix
- ::new — Ogr::GraphAsTriMatrix
- ::new — Ogr::MinimumSpanningTree
- ::new — Ogr::ShortestPaths
- ::new — Ogr::TopologicalSort
- ::new — Ogr::UnionFind
- ::new_dense — Ogr::Digraph
- ::new_dense — Ogr::Graph
- #add — Ogr::EdgeBag
- #add — Ogr::Graph
- #add — Ogr::GraphAsList
- #add — Ogr::GraphAsMatrix
- #add_edge — Ogr::Graph
- #add_edges — Ogr::Graph
- #calculate — Ogr::MinimumSpanningTree
- #component — Ogr::ConnectedComponents
- #components — Ogr::ConnectedComponents
- #connected? — Ogr::ConnectedComponents
- #connected? — Ogr::GraphAsList
- #connected? — Ogr::GraphAsMatrix
- #connected? — Ogr::UnionFind
- #count — Ogr::ConnectedComponents
- #degree — Ogr::Graph
- #degree — Ogr::GraphAsList
- #degree — Ogr::GraphAsMatrix
- #degree — Ogr::GraphAsTriMatrix
- #dfs — Ogr::ConnectedComponents
- #dfs — Ogr::DepthFirstSearch
- #dfs — Ogr::TopologicalSort
- #distance_to — Ogr::ShortestPaths
- #each — Ogr::EdgeBag
- #each_edge — Ogr::Graph
- #each_edge — Ogr::GraphAsList
- #each_edge — Ogr::GraphAsMatrix
- #each_edge — Ogr::GraphAsTriMatrix
- #each_vertex — Ogr::Graph
- #edge? — Ogr::Graph
- #edge? — Ogr::GraphAsList
- #edge? — Ogr::GraphAsMatrix
- #edges — Ogr::Graph
- #edges — Ogr::MinimumSpanningTree
- #find_components — Ogr::ConnectedComponents
- #find_paths — Ogr::ShortestPaths
- #found_better — Ogr::ShortestPaths
- #from — Ogr::ShortestPaths
- #get — Ogr::EdgeBag
- #get — Ogr::GraphAsList
- #get_edge — Ogr::Graph
- #get_edge — Ogr::GraphAsList
- #get_edge — Ogr::GraphAsMatrix
- #in_degree — Ogr::Digraph
- #index — Ogr::Graph
- #neighbors — Ogr::Graph
- #neighbors — Ogr::GraphAsList
- #neighbors — Ogr::GraphAsMatrix
- #out_degree — Ogr::Digraph
- #path? — Ogr::ShortestPaths
- #path_to — Ogr::ShortestPaths
- #push — Ogr::Graph
- #relax — Ogr::ShortestPaths
- #remove — Ogr::EdgeBag
- #remove — Ogr::Graph
- #remove — Ogr::GraphAsList
- #remove — Ogr::GraphAsMatrix
- #root — Ogr::UnionFind
- #search — Ogr::BreadthFirstSearch
- #search — Ogr::DepthFirstSearch
- #size — Ogr::EdgeBag
- #sort — Ogr::TopologicalSort
- #undirected? — Ogr::GraphAsList
- #union — Ogr::UnionFind
- #update_sizes — Ogr::UnionFind
- #vc — Ogr::Graph
- #vertex_size — Ogr::Graph
- #vertexes — Ogr::ConnectedComponents
- #vertexes — Ogr::Graph
- #vertexes — Ogr::GraphAsMatrix
- #visit — Ogr::ConnectedComponents
- #visit — Ogr::DepthFirstSearch
- #visit_neighbors — Ogr::BreadthFirstSearch
- #visit_node — Ogr::BreadthFirstSearch
- #visit_source — Ogr::BreadthFirstSearch
- #visited? — Ogr::BreadthFirstSearch