Download presentation

Presentation is loading. Please wait.

Published byCamron Hesketh Modified over 2 years ago

1
Introduction Description Functions Prices Library for processing graphs Object oriented C++ classes Annotation Specials

2
Introduction Graph - mapping set of nodes on itself, can be painted on paper as circles - nodes, and arrows - frames. Using more simple data structures as matrixes and arrays, graph can be defined by four such methods list of edges (directed - frames), i.e. pairs of incidental nodes adjacency matrix - square matrix, so each element shows one possibility of edge before two nodes for each node can be binded list of nodes of outgoing income edges for each node can be binded list of nodes of incoming outgo edges

3
Annotation Library "G-Lib" is set of objects for store and manipulate mathematic graphs and nets. Realisation way of graph processing algorithms, allow in most cases to work with graphs in any representation. In library presented four basic representations of graphs: list of edges adjacency matrix list of income edges list outgo edges

4
Specials Algorithms manipulating graphs usually, sifts nodes and belonging them edges, this processing representing in library by iterators. So possible write code not depending of graphs representation. In real tasks, not single math, graph often needs to divide by subgraphs, but process as solid graph - this support by library classes, as well as interface helping supply accordance with real task data in changing graph model. A lot of supplying and often using on graphs operations and classes of edges, nodes, and lists - allow begin straight to solve main aim of program.

5
Brief description of library modules Module G : definitions of constants and abstract graph class Module GImages : definitions of types for basic graph representation Module GLance : definitions for supply classes Module GraphL: list of edges Module GraphB: adjacency matrix Module GraphD: adjacency matrix Module GraphI: list of nodes of outgoing edges Module GraphO: list of nodes of incoming edges Module GraphMG: graph of subgraphs Module SupplyG : algorithms supplying often used on graph operations Module BitField : bit field object Module Matrix : bit matrix object

6
Functionality of library

7
Attended prices: Cost of library 50.00 Cost of module 3.33 Function cost 0.07 Cost of line 0.003

Similar presentations

OK

Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.

Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google