Search of The Optimum Itinerary on a Digitized Road Network

dc.contributor.authorCHOUDER, IMANE Supervisor2: Gadri, Said
dc.date.accessioned2021-09-06T10:52:58Z
dc.date.available2021-09-06T10:52:58Z
dc.date.issued2021
dc.description.abstractThe work presented in this note revolves around identifying the field of graph theory, graph its properties, types, and ways of presenting it, and mentioning some of the problems specific to this field, especially the focus on SPP and its three types, especially the second type, which is related to Finding SP from a given vertex x to all other vertices , There is also an explanation of a desktop application for finding SP in Weighted directed graph by Dijkstra's algorithm && Bellman's algorithm .en_US
dc.identifier.urihttps://repository.univ-msila.dz/handle/123456789/25414
dc.language.isoenen_US
dc.publisherUniversity of M'silaen_US
dc.subjectGraph theory, graph, arcs, vertex, Shortest path problem, SSP, Shortest path, SP, Graph’s Type, valued graph, Complete graph, Simple graph , Empty graph, Trivial graph, Refletive graph , Transitive graph, inverse of the graph, Complementary graph, Multigraph graph, Bipartite graph, Planar graph, Isomorphic Graph, Subgraph, partial graph, partial subgraph.en_US
dc.titleSearch of The Optimum Itinerary on a Digitized Road Networken_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
CHOUDER IMANE.pdf
Size:
877.9 KB
Format:
Adobe Portable Document Format
Description:
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:

Collections